Convergence rate analysis of nonconvex nonmonotone descent methods under the Hölderian value proximity error bound condition
Authors:
- Pengjie LiuPLPengjie Liu
- Yuanmin WangYWYuanmin Wang
- Hu ShaoHSHu Shao
- Bohan LiBLBohan Li
- 22 June 2026
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 68
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China
This publication has 15 references indexed in Scilit:
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problemsJournal of Global Optimization, 2024
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization ProblemsSIAM Journal on Optimization, 2023
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse ProblemsSIAM Journal on Optimization, 2018
- Linearly Constrained Non-Lipschitz Optimization for Image RestorationSIAM Journal on Imaging Sciences, 2015
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient MethodComputational Optimization and Applications, 2002
- A truncated Newton method with nonmonotone line search for unconstrained optimizationJournal of Optimization Theory and Applications, 1989
- A Nonmonotone Line Search Technique for Newton’s MethodSIAM Journal on Numerical Analysis, 1986