Mathematical Programming

, Volume 117, Issue 1, pp 387–423

A coordinate gradient descent method for nonsmooth separable minimization


DOI: 10.1007/s10107-007-0170-0

Cite this article as:
Tseng, P. & Yun, S. Math. Program. (2009) 117: 387. doi:10.1007/s10107-007-0170-0


We consider the problem of minimizing the sum of a smooth function and a separable convex function. This problem includes as special cases bound-constrained optimization and smooth optimization with ℓ1-regularization. We propose a (block) coordinate gradient descent method for solving this class of nonsmooth separable problems. We establish global convergence and, under a local Lipschitzian error bound assumption, linear convergence for this method. The local Lipschitzian error bound holds under assumptions analogous to those for constrained smooth optimization, e.g., the convex function is polyhedral and the smooth function is (nonconvex) quadratic or is the composition of a strongly convex function with a linear mapping. We report numerical experience with solving the ℓ1-regularization of unconstrained optimization problems from Moré et al. in ACM Trans. Math. Softw. 7, 17–41, 1981 and from the CUTEr set (Gould and Orban in ACM Trans. Math. Softw. 29, 373–394, 2003). Comparison with L-BFGS-B and MINOS, applied to a reformulation of the ℓ1-regularized problem as a bound-constrained optimization problem, is also reported.


Error boundGlobal convergenceLinear convergence rateNonsmooth optimizationCoordinate descent

Mathematics Subject Classification (2000)


Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of WashingtonSeattleUSA