A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
From MaRDI portal
Publication:6145571
DOI10.1007/s11075-023-01569-yzbMath1530.65066OpenAlexW4382699812MaRDI QIDQ6145571
No author found.
Publication date: 9 January 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-023-01569-y
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Introductory lectures on convex optimization. A basic course.
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Adaptive restart for accelerated gradient schemes
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
- Convergence Rates of Inertial Forward-Backward Algorithms
- Sparse Signal Recovery Using Iterative Proximal Projection
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
- Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier
- Group variable selection via SCAD-L2
- Sharpness, Restart, and Acceleration
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- An introduction to continuous optimization for imaging
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
