FISTA restart using an automatic estimation of the growth parameter

DOI10.1007/S10957-025-02688-3MaRDI QIDQ6952240zbMATH OpenFDO

Authors Jean-François Aujol, Charles Dossal, Hippolyte Labarrière, Aude Rondepierre

Publication date 28 July 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02688-3

zbMATH Keywords

convergence rateconvex optimizationFISTAgrowth parameterrestartŁojasiewicz property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
• Accelerated iterative regularization via dual diagonal descent
• Adaptive restart for accelerated gradient schemes
• Adaptive restart of accelerated gradient methods under local quadratic growth condition
• An Optimal Algorithm for Constrained Differentiable Convex Optimization
• Backtracking strategies for accelerated descent methods with smooth composite objectives
• Clarke Subgradients of Stratifiable Functions
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
• Convergence Rates in Forward--Backward Splitting
• Convergence rates of the heavy-ball method under the Łojasiewicz property
• Fast first-order methods for composite convex optimization with backtracking
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
• FISTA is an automatic geometrically optimized algorithm for strongly convex functions
• From error bounds to the complexity of first-order descent methods for convex functions
• Gradient methods for minimizing composite functions
• scientific article; zbMATH DE number 3371284 (Why is no real title available?)
• Linear convergence of first order methods for non-strongly convex optimization
• On semi- and subanalytic geometry
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Sharpness, restart, and acceleration
• Some methods of speeding up the convergence of iteration methods
• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2

Cited in

(1)

• Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization

This page was built for publication: FISTA restart using an automatic estimation of the growth parameter

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