An adaptive Polyak heavy-ball method
From MaRDI portal
Publication:2102380
DOI10.1007/S10994-022-06215-7OpenAlexW4285801387WikidataQ114224928 ScholiaQ114224928MaRDI QIDQ2102380FDOQ2102380
Authors: Yanyan Li 
Publication date: 28 November 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-022-06215-7
Cites Work
- iPiano: inertial proximal algorithm for nonconvex optimization
- iPiasco: inertial proximal algorithm for strongly convex optimization
- ImageNet
- Adaptive subgradient methods for online learning and stochastic optimization
- Introductory lectures on convex optimization. A basic course.
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- First-Order Methods in Optimization
- A Stochastic Approximation Method
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Some methods of speeding up the convergence of iteration methods
- A literature survey of benchmark functions for global optimisation problems
- Heavy-ball method in nonconvex optimization problems
- Title not available (Why is that?)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Stochastic heavy ball
- Automated adaptation strategies for stream learning
- Stochastic gradient descent with Polyak's learning rate
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: An adaptive Polyak heavy-ball method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102380)
