FISTA is an automatic geometrically optimized algorithm for strongly convex functions

DOI10.1007/s10107-023-01960-6OpenAlexW4362718467MaRDI QIDQ6120847

Charles Dossal, Aude Rondepierre, Jean-François Aujol

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-023-01960-6

zbMATH Keywords

optimizationODEfirst order schemeNesterov acceleration

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• iPiasco: inertial proximal algorithm for strongly convex optimization
• On semi- and subanalytic geometry
• From error bounds to the complexity of first-order descent methods for convex functions
• Adaptive restart for accelerated gradient schemes
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• Linear convergence of first order methods for non-strongly convex optimization
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Clarke Subgradients of Stratifiable Functions
• Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization
• Optimal Convergence Rates for Nesterov Acceleration
• Adaptive restart of accelerated gradient methods under local quadratic growth condition
• An introduction to continuous optimization for imaging

This page was built for publication: FISTA is an automatic geometrically optimized algorithm for strongly convex functions