Convergence properties of monotone and nonmonotone proximal gradient methods revisited
From MaRDI portal
Publication:2093287
DOI10.1007/s10957-022-02101-3zbMath1506.90246arXiv2112.01798OpenAlexW4298006464MaRDI QIDQ2093287
Christian Kanzow, Patrick Mehlitz
Publication date: 7 November 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.01798
Related Items
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Constrained composite optimization and augmented Lagrangian methods, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- A concave optimization-based approach for sparse portfolio selection
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Computing a Trust Region Step
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A generalized proximal point algorithm for certain non-convex minimization problems
- Variational Analysis
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Variational Analysis and Applications
- On $l_q$ Optimization and Matrix Completion
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- First-Order Methods in Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
- Signal Recovery by Proximal Forward-Backward Splitting
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- An augmented Lagrangian method for optimization problems with structured geometric constraints
