A class of line search-type methods for nonsmooth convex regularized minimization
Author:
- 4 March 2021
- journal article
- research article
- Published by Springer Nature in Soft Computing
- Vol. 25 (10) , 7131-7141
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11371073 and 61972055<)
This publication has 24 references indexed in Scilit:
- A short note on the global convergence of the unmodified PRP methodOptimization Letters, 2012
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex MinimizationSIAM Journal on Imaging Sciences, 2010
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergenceIMA Journal of Numerical Analysis, 2006
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization ProblemSIAM Journal on Optimization, 1997
- CUTEACM Transactions on Mathematical Software, 1995
- On the Barzilai and Borwein choice of steplength for the gradient methodIMA Journal of Numerical Analysis, 1993
- Global Convergence Properties of Conjugate Gradient Methods for OptimizationSIAM Journal on Optimization, 1992
- Two-Point Step Size Gradient MethodsIMA Journal of Numerical Analysis, 1988
- A Nonmonotone Line Search Technique for Newton’s MethodSIAM Journal on Numerical Analysis, 1986
- The conjugate gradient method in extremal problemsUSSR Computational Mathematics and Mathematical Physics, 1969