15 citations · 54 across the 38 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…
Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems
Alexander Titov, Fedor Stonyakin, Mohammad Alkousa +2
Recently some specific classes of non-smooth and non-Lipschitz convex optimization problems were selected by Yu.~Nesterov along with H.~Lu. We consider convex programming problems…
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…