Convergence rates of the heavy ball method for quasi-strongly convex optimization
From MaRDI portal
Publication:5097013
DOI10.1137/21M1403990OpenAlexW3034889619WikidataQ114074080 ScholiaQ114074080MaRDI QIDQ5097013FDOQ5097013
Authors: Jean-François Aujol, Charles Dossal, Aude Rondepierre 
Publication date: 19 August 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1403990
Recommendations
- scientific article; zbMATH DE number 165426
- The rate of convergence of optimization algorithms obtained via discretizations of heavy ball dynamical systems for convex optimization problems
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
- Stochastic heavy ball
- A robust control approach to asymptotic optimality of the heavy ball method for optimization of quadratic functions
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- Title not available (Why is that?)
- On semi- and subanalytic geometry
- Title not available (Why is that?)
- THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
- Some methods of speeding up the convergence of iteration methods
- On a second order dissipative ODE in Hilbert spaces with an integrable source term
- Some first-order algorithms for total variation based image restoration
- Linear convergence of first order methods for non-strongly convex optimization
- Asymptotics for a second-order differential equation with nonautonomous damping and an integrable source term
- Asymptotic for the perturbed heavy ball system with vanishing damping term
- AN EXISTENCE RESULT FOR VIBRATIONS WITH UNILATERAL CONSTRAINTS
- On damped second-order gradient systems
- Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
- Convergence Rates of Damped Inertial Dynamics under Geometric Conditions and Perturbations
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Optimal Convergence Rates for Nesterov Acceleration
Cited In (13)
- On the convergence analysis of aggregated heavy-ball method
- First order inertial optimization algorithms with threshold effects associated with dry friction
- Fast optimization via inertial dynamics with closed-loop damping
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Title not available (Why is that?)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- Non-monotone Behavior of the Heavy Ball Method
- The heavy ball method regularized by Tikhonov term. Simultaneous convergence of values and trajectories
- A robust control approach to asymptotic optimality of the heavy ball method for optimization of quadratic functions
- A new proximal heavy ball inexact line-search algorithm
- Fast convergence of inertial dynamics with Hessian-driven damping under geometry assumptions
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions
This page was built for publication: Convergence rates of the heavy ball method for quasi-strongly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097013)
