Proximal gradient methods beyond monotony
From MaRDI portal
Publication:6567228
DOI10.46298/JNSAO-2023-10290zbMATH Open1544.90158MaRDI QIDQ6567228FDOQ6567228
Authors: A. de Marchi 
Publication date: 4 July 2024
Published in: Journal of Nonsmooth Analysis and Optimization (Search for Journal in Brave)
Recommendations
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Gradient methods for minimizing composite functions
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Efficient regularized proximal quasi-Newton methods for large-scale nonconvex composite optimization problems
gradient methodsnonsmooth nonconvex optimizationproximal algorithmsnonmonotone linesearchspectral stepsize
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Methods of reduced gradient type (90C52)
Cites Work
- Computing a Trust Region Step
- Practical augmented Lagrangian methods for constrained optimization
- Variational Analysis
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- First-order methods in optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A coordinate gradient descent method for nonsmooth separable minimization
- Proximal splitting methods in signal processing
- Sparse Reconstruction by Separable Approximation
- A generalized proximal point algorithm for certain non-convex minimization problems
- A Nonmonotone Line Search Technique for Newton’s Method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Convex analysis and monotone operator theory in Hilbert spaces
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Proximal Newton-type methods for minimizing composite functions
- Variational analysis and applications
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Constrained composite optimization and augmented Lagrangian methods
Cited In (2)
This page was built for publication: Proximal gradient methods beyond monotony
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567228)
