Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
From MaRDI portal
Publication:6157998
DOI10.1137/22m1469663zbMath1519.90192arXiv2201.00639OpenAlexW4379162380MaRDI QIDQ6157998
Publication date: 22 June 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00639
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An augmented Lagrangian approach for sparse principal component analysis
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A truncated Newton method with non-monotone line search for unconstrained optimization
- On gradients of functions definable in o-minimal structures
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Gradient-Based Methods for Sparse Recovery
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems
- Sparse Reconstruction by Separable Approximation
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- On the nonmonotone line search
