Accelerated meta-algorithm for convex optimization problems

DOI10.1134/S096554252101005XzbMath1461.90096arXiv2004.08691OpenAlexW3134714720MaRDI QIDQ2656390

A. V. Chernov, N. K. Tupitsa, D. M. Dvinskikh, Alexander V. Gasnikov, V. V. Matyukhin, D. A. Pasechnyuk, D. I. Kamzolov, Pavel Dvurechensky

Publication date: 11 March 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationslidingcatalystinexact oracletensor methodsaccelerated proximal method

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (7)

Oracle complexity separation in convex optimization ⋮ On Numerical Estimates of Errors in Solving Convex Optimization Problems ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ Accelerated variance-reduced methods for saddle-point problems ⋮ Adaptive Catalyst for Smooth Convex Optimization ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ Accelerated proximal envelopes: application to componentwise methods

Uses Software

• GitHub

Cites Work

• Finite sample Bernstein-von Mises theorem for semiparametric problems
• Lectures on convex optimization
• Accelerated methods for saddle-point problem
• Implementable tensor methods in unconstrained convex optimization
• An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
• Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives
• Contracting Proximal Methods for Smooth Convex Optimization

This page was built for publication: Accelerated meta-algorithm for convex optimization problems