Convergence rates of the heavy ball method for quasi-strongly convex optimization
From MaRDI portal
(Redirected from Publication:5097013)
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
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- AN EXISTENCE RESULT FOR VIBRATIONS WITH UNILATERAL CONSTRAINTS
- Analysis and design of optimization algorithms via integral quadratic constraints
- Asymptotic for the perturbed heavy ball system with vanishing damping term
- Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
- Asymptotics for a second-order differential equation with nonautonomous damping and an integrable source term
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Convergence rates of damped inertial dynamics under geometric conditions and perturbations
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of first order methods for non-strongly convex optimization
- On a second order dissipative ODE in Hilbert spaces with an integrable source term
- On damped second-order gradient systems
- On semi- and subanalytic geometry
- Optimal convergence rates for Nesterov acceleration
- Some first-order algorithms for total variation based image restoration
- Some methods of speeding up the convergence of iteration methods
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- 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
Cited in
(29)- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Stochastic heavy ball
- A piecewise conservative method for unconstrained convex optimization
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
- An adaptive Polyak heavy-ball method
- On the convergence analysis of aggregated heavy-ball method
- Non-monotone Behavior of the Heavy Ball Method
- scientific article; zbMATH DE number 165426 (Why is no real title available?)
- Essential convergence rate of ordinary differential equations appearing in optimization
- The rate of convergence of optimization algorithms obtained via discretizations of heavy ball dynamical systems for convex optimization problems
- Optimal convergence rates for Nesterov acceleration
- Fast convergence of inertial dynamics with Hessian-driven damping under geometry assumptions
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- A robust control approach to asymptotic optimality of the heavy ball method for optimization of quadratic functions
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions
- First order inertial optimization algorithms with threshold effects associated with dry friction
- The heavy ball method regularized by Tikhonov term. Simultaneous convergence of values and trajectories
- Fast optimization via inertial dynamics with closed-loop damping
- A new proximal heavy ball inexact line-search algorithm
- The projected heavy-ball method for quasar-monotone variational inequalities and quasar-convex optimization
- On a class of second-order dynamical systems involving viscous and Hessian-driven damping
- The application of Goeken-Johnson's Runge-Kutta methods in unconstrained convex optimization
- Losing momentum in continuous-time stochastic optimisation
- Characterizing the global optimum of a class of nonconvex optimization problems with a comparison of several algorithms
- Characterizations, dynamical systems and gradient methods for strongly quasiconvex functions
- Heavy ball and Nesterov accelerations with Hessian-driven damping for nonconvex optimization
- Heavy-ball differential equation achieves \(O(\varepsilon^{-7/4})\) convergence for nonconvex functions
- On the application of explicit Runge-Kutta methods to the construction of stochastic gradient descent methods for convex optimization
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
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)
