A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems

DOI10.1007/S11075-023-01569-YzbMATH Open1530.65066OpenAlexW4382699812MaRDI QIDQ6145571FDOQ6145571

Authors:

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

Recommendations

• Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
• A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
• A note on the accelerated proximal gradient method for nonconvex optimization
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems

zbMATH Keywords

convergenceaccelerated proximal gradient methodKurdyka-Łojasiewicz property

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• iPiano: inertial proximal algorithm for nonconvex optimization
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Variational Analysis
• Introductory lectures on convex optimization. A basic course.
• Adaptive restart for accelerated gradient schemes
• Gradient methods for minimizing composite functions
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Title not available (Why is that?)
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Title not available (Why is that?)
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• An introduction to continuous optimization for imaging
• 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\)
• Group variable selection via SCAD-L<sub>2</sub>
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
• Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
• A nonmonotone alternating updating method for a class of matrix factorization problems
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
• Sparse Signal Recovery Using Iterative Proximal Projection
• Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
• Convergence rates of inertial forward-backward algorithms
• 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
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate
• Adaptive restart of accelerated gradient methods under local quadratic growth condition
• Sharpness, restart, and acceleration
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
• Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier

Cited In (3)

• Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
• A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems

This page was built for publication: A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145571)