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

scientific article; zbMATH DE number 7785646

Language	Label	Description	Also known as
English	A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems	scientific article; zbMATH DE number 7785646

Statements

instance of

scholarly article

0 references

title

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

0 references

published in

Numerical Algorithms

0 references

publication date

9 January 2024

0 references

zbMATH Keywords

accelerated proximal gradient method

0 references

Kurdyka-Łojasiewicz property

0 references

convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11075-023-01569-y

0 references

cites work

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$

0 references

Convergence Rates of Inertial Forward-Backward Algorithms

0 references

A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima

0 references

Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule

0 references

Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions

0 references

Q4001523

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

An introduction to continuous optimization for imaging

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Restarting the accelerated coordinate descent method with a rough strong convexity estimate

0 references

Adaptive restart of accelerated gradient methods under local quadratic growth condition

0 references

Sparse Signal Recovery Using Iterative Proximal Projection

0 references

Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions

0 references

Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems

0 references

Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier

0 references

Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization

0 references

Gradient methods for minimizing composite functions

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Q5652137

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

Adaptive restart for accelerated gradient schemes

0 references

Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems

0 references

Sharpness, Restart, and Acceleration

0 references

A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights

0 references

Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems

0 references

Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems

0 references

General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems

0 references

A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems

0 references

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

0 references

Group variable selection via SCAD-<i>L</i><sub>2</sub>

0 references

Variational Analysis

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

Identifiers

zbMATH Open document ID

1530.65066

0 references

DOI

10.1007/s11075-023-01569-y

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6145571