2 citations · 7 across the 20 of their papers we have counts for
3 papers · 1 filter
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables
Egor Gladin, Ilya Kuruzov, Fedor Stonyakin +3
The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the…
Oracle Complexity Separation in Convex Optimization
Anastasiya Ivanova, Evgeniya Vorontsova, Dmitry Pasechnyuk +4
Many convex optimization problems have structured objective function written as a sum of functions with different types of oracles (full gradient, coordinate derivative, stochastic…
Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model
Fedor Stonyakin, Alexander Tyurin, Alexander Gasnikov +7
In this paper, we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems, and vari…