A note on the gradient-evaluation sequence in accelerated gradient methods
From MaRDI portal
Cites work
- A Lyapunov analysis of accelerated methods in optimization
- Accelerated gradient sliding for structured convex optimization
- Accelerated schemes for a class of variational inequalities
- An accelerated linearized alternating direction method of multipliers
- DYNAMICAL, SYMPLECTIC AND STOCHASTIC PERSPECTIVES ON GRADIENT-BASED OPTIMIZATION
- First-order and stochastic optimization methods for machine learning
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Information-based complexity of linear operator equations
- Lectures on convex optimization
- Optimized first-order methods for smooth convex minimization
- Performance of first-order methods for smooth convex minimization: a novel approach
- Robust Portfolio Selection Problems
- Smooth minimization of non-smooth functions
- Understanding the acceleration phenomenon via high-resolution differential equations
- Universal gradient methods for convex optimization problems
This page was built for publication: A note on the gradient-evaluation sequence in accelerated gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444036)