A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
From MaRDI portal
Publication:6145571
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
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A nonmonotone alternating updating method for a class of matrix factorization problems
- Adaptive restart for accelerated gradient schemes
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
- An introduction to continuous optimization for imaging
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Convergence rates of inertial forward-backward algorithms
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Gradient methods for minimizing composite functions
- Group variable selection via SCAD-L2
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- 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
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Sharpness, restart, and acceleration
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Sparse Signal Recovery Using Iterative Proximal Projection
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(3)- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- 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
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)
