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

Author： Yun Sangwoon   Toh Kim-Chuan  

Publisher： Springer Publishing Company

ISSN： 0926-6003

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

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

An Augmented Lagrangian Method for TV g +L 1-norm Minimization

By Koko Jonas   Jehan-Besson Stéphanie  

Journal of Mathematical Imaging and Vision, Vol. 38, Iss. 3, 2010-11 ,pp. : 182-196

Springer Publishing Company

Access to resources Recommend Favorite

Randomized first order algorithms with applications to l 1-minimization

By Juditsky Anatoli   Kılınç Karzan Fatma   Nemirovski Arkadi  

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 269-310

Elsevier

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

Pattern Search Method for Discrete L 1–Approximation

By Bogani C.   Gasparo M.   Papini A.  

Journal of Optimization Theory and Applications, Vol. 134, Iss. 1, 2007-07 ,pp. : 47-59

Springer Publishing Company

Access to resources Recommend Favorite