Ekaterina Borodich

activity

20232025

most citedOptimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.OC2025

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization

Ekaterina Borodich, Dmitry Kovalev

In this paper, we focus on the problem of minimizing a continuously differentiable convex objective function, $min_{x} f (x)$ . Recently, Malitsky (2020); Alacaoglu et al.(2023) devel…

math.OC2024

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms

Dmitry Kovalev, Ekaterina Borodich

We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $min_{x} max_{y} f (x) + ⟨ y, B x ⟩ - g (y)$ . In the highly specific case whe…

math.OC2023★ 1 cited

Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems

Ekaterina Borodich, Georgiy Kormakov, Dmitry Kovalev +2

In this work, we focuses on the following saddle point problem $min_{x} max_{y} p (x) + R (x, y) - q (y)$ where $R (x, y)$ is $L_{R}$ -smooth, $μ_{x}$ -strongly convex, $μ_{y}$ -strongly concave an…