A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound property
- 30 April 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 174 (1-2) , 327-358
Abstract
No abstract availableKeywords
Funding Information
- Hong Kong Research Grants Council (CUHK 14206814, CUHK 14208117)
- Microsoft Research Asia
This publication has 35 references indexed in Scilit:
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutionsMathematical Programming, 2013
- Approximation accuracy, gradient methods, and error bound for structured convex optimizationMathematical Programming, 2010
- A coordinate gradient descent method for ℓ 1-regularized convex minimizationComputational Optimization and Applications, 2009
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Automatic Smoothing With Wavelets for a Wide Class of DistributionsJournal of Computational and Graphical Statistics, 2004
- Local behavior of an iterative framework for generalized equations with nonisolated solutionsMathematical Programming, 2002
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth MinimizationSIAM Journal on Control and Optimization, 1992
- The Levenberg-Marquardt algorithm: Implementation and theory1978