A coordinate gradient descent method for nonsmooth separable minimization

Author： Tseng Paul  

Publisher： Springer Publishing Company

ISSN： 0025-5610

Source： Mathematical Programming, Vol.117, Iss.1-2, 2009-03, pp. : 387-423

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A coordinate gradient descent method for l 1-regularized convex minimization

By Yun Sangwoon   Toh Kim-Chuan  

Computational Optimization and Applications, Vol. 48, Iss. 2, 2011-03 ,pp. : 273-307

Springer Publishing Company

Access to resources Recommend Favorite

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

By Tseng P.  

Journal of Optimization Theory and Applications, Vol. 109, Iss. 3, 2001-06 ,pp. : 475-494

Springer Publishing Company

Access to resources Recommend Favorite

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training

By Tseng Paul   Yun Sangwoon  

Computational Optimization and Applications, Vol. 47, Iss. 2, 2010-10 ,pp. : 179-206

Springer Publishing Company

Access to resources Recommend Favorite

A memory gradient method for non-smooth convex optimization

By Ou Yigui   Liu Yuanwen  

International Journal of Computer Mathematics, Vol. 92, Iss. 8, 2015-08 ,pp. : 1625-1642

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally Convergent Variable Metric Method for Convex Nonsmooth Unconstrained Minimization1

By Lukšan L.   Vlček J.  

Journal of Optimization Theory and Applications, Vol. 102, Iss. 3, 1999-09 ,pp. : 593-613

Springer Publishing Company

Access to resources Recommend Favorite