Journal of Machine Learning Research–57 Submitted 11 08; Revised 11 09; Published - 10 A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning - Subderivative - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2010-03-07 22:04:30 Limited-memory BFGS BFGS method Quasi-Newton method Gradient descent Orthant-wise limited-memory quasi-Newton Wolfe conditions Convex optimization Hessian matrix Subderivative Numerical analysis Mathematical analysis Mathematical optimization		Journal of Machine Learning Research–57 Submitted 11/08; Revised 11/09; Published -/10 A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning Add to Reading List Source URL: www.stat.purdue.edu Download Document from Source Website File Size: 2,61 MB Share Document on Facebook

	A Modified Orthant-Wise Limited Memory Quasi-Newton Method Supplementary Material for “A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis” A. BFGS and L-BFGS For self-containedness, DocID: 1vavi - View Document
	A Modified Orthant-Wise Limited Memory Quasi-Newton Method Supplementary Material for “A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis” A. BFGS and L-BFGS For self-containedness, DocID: 1mxXV - View Document
	Journal of Machine Learning Research–57 Submitted 11/08; Revised 11/09; Published -/10 A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning DocID: 17Mdi - View Document
	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Greedy Sparsity-Constrained Optimization Bahmani, S.; Raj, B.; Boufounos, P.T. DocID: 13zIl - View Document
	Scalable Training of L1 -Regularized Log-Linear Models Galen Andrew Jianfeng Gao Microsoft Research, One Microsoft Way, Redmond, WA[removed]USA DocID: rJoV - View Document