Gradient methods with memory
From MaRDI portal
Publication:5043847
DOI10.1080/10556788.2020.1858831zbMath1502.90132arXiv2105.09241OpenAlexW3162537520MaRDI QIDQ5043847
Mihai I. Florea, Yu. E. Nesterov
Publication date: 6 October 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09241
Related Items (2)
Optimal Convergence Rates for the Proximal Bundle Method ⋮ Inexact model: a framework for optimization and variational inequalities
Cites Work
- Gradient methods for minimizing composite functions
- Lectures on convex optimization
- Complexity bounds for primal-dual methods minimizing the model of objective function
- An Optimal First Order Method Based on Optimal Quadratic Averaging
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
This page was built for publication: Gradient methods with memory