On the convergence analysis of aggregated heavy-ball method

DOI10.1007/978-3-031-09607-5_1OpenAlexW4285113581MaRDI QIDQ2104283FDOQ2104283

Authors: Marina Danilova 

Publication date: 7 December 2022

Full work available at URL: https://arxiv.org/abs/2203.02396

Recommendations

• Stochastic heavy ball
• Convergence rates of the heavy ball method for quasi-strongly convex optimization
• Non-monotone Behavior of the Heavy Ball Method
• Generalized momentum-based methods: a Hamiltonian perspective
• On the Convergence Rate of Incremental Aggregated Gradient Algorithms

zbMATH Keywords

first-order methodssmooth optimizationmomentum methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Analysis and design of optimization algorithms via integral quadratic constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some methods of speeding up the convergence of iteration methods
• Lectures on convex optimization
• Perturbed iterate analysis for asynchronous stochastic optimization

Cited In (3)

• On the Convergence Analysis of Aggregated Heavy-Ball Method
• Non-monotone Behavior of the Heavy Ball Method
• The heavy ball method regularized by Tikhonov term. Simultaneous convergence of values and trajectories

Uses Software

• LIBSVM
• PyTorch
• GitHub

This page was built for publication: On the convergence analysis of aggregated heavy-ball method

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