Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

Author： Tseng P.  

Publisher： Springer Publishing Company

ISSN： 0022-3239

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

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 nonsmooth separable minimization

By Tseng Paul  

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

Springer Publishing Company

Access to resources Recommend Favorite

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

Subgradient Method with Entropic Projections for Convex Nondifferentiable Minimization

By Kiwiel K.C.  

Journal of Optimization Theory and Applications, Vol. 96, Iss. 1, 1998-01 ,pp. : 159-173

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained Minimization

By Vlček J.   Lukšan L.  

Journal of Optimization Theory and Applications, Vol. 111, Iss. 2, 2001-11 ,pp. : 407-430

Springer Publishing Company

Access to resources Recommend Favorite

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

By Richtárik Peter   Takáč Martin  

Mathematical Programming, Vol. 144, Iss. 1-2, 2014-04 ,pp. : 1-38

Elsevier

Access to resources Recommend Favorite