2 citations · 4 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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 where is -smooth, -strongly convex, -strongly concave an…
math.OC2023★ 1 cited
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks?
Dmitriy Metelev, Alexander Rogozin, Dmitry Kovalev +1
We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the net…