Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- 5 October 2020
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 79 (4) , 853-883
Abstract
No abstract availableKeywords
All Related Versions
This publication has 54 references indexed in Scilit:
- A Sparse-Group LassoJournal of Computational and Graphical Statistics, 2013
- Structured Sparsity through Convex OptimizationStatistical Science, 2012
- Smoothing methods for nonsmooth, nonconvex minimizationMathematical Programming, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- A note on the complexity of L p minimizationMathematical Programming, 2011
- Approximation accuracy, gradient methods, and error bound for structured convex optimizationMathematical Programming, 2010
- Restricted isometry properties and nonconvex compressive sensingInverse Problems, 2008
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004