General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
Authors:
- 18 February 2019
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 73 (1) , 129-158
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11771078, 71661147004)
- Natural Science Foundation of Jiangsu Province (BK20181258)
- Project 333 of Jiangsu Province (BRA2018351)
- Postgraduate Research & Practice Innovation Program of Jiangsu Province (KYCX18_0200)
This publication has 42 references indexed in Scilit:
- Sparse solutions to random standard quadratic optimization problemsMathematical Programming, 2012
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completionThe Annals of Statistics, 2011
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Convergence of a splitting inertial proximal method for monotone operatorsJournal of Computational and Applied Mathematics, 2003
- On gradients of functions definable in o-minimal structuresAnnales de l'institut Fourier, 1998
- 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
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964