Accelerated gradient sliding for minimizing a sum of functions

DOI10.1134/S1064562420030084MaRDI QIDQ2243755zbMATH OpenOpenAlexFDO

Authors D. M. Dvinskikh, S. S. Omelchenko, Alexander V. Gasnikov, A. I. Tyurin

Publication date 11 November 2021

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064562420030084

zbMATH Keywords

accelerated gradient sliding of G. Lanaccelerated variance reduction methodssmooth strongly convex functions

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Gradient methods for minimizing composite functions
• Accelerated gradient sliding for structured convex optimization
• Gradient sliding for composite optimization
• A proximal stochastic gradient method with progressive variance reduction
• Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order o(1/k^2)

Cites work

• Gradient methods for minimizing composite functions
• Optimization methods for large-scale machine learning
• Smooth minimization of non-smooth functions
• Understanding machine learning. From theory to algorithms

Cited in

(3)

• Finding approximate local minima faster than gradient descent
• Adaptive Catalyst for Smooth Convex Optimization
• One-point feedback for composite optimization with applications to distributed and federated learning

This page was built for publication: Accelerated gradient sliding for minimizing a sum of functions

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