Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks

DOI10.1007/978-3-030-91059-4_18zbMath1527.90252arXiv2107.05957OpenAlexW3213570277MaRDI QIDQ6372653

A. V. Gasnikov, Aleksandr Beznosikov, Alexander Rogozin, Dmitry P. Kovalev

Publication date: 13 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-91059-4_18

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)

Related Items (6)

Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs ⋮ Min-max optimization over slowly time-varying graphs ⋮ Decentralized saddle-point problems with different constants of strong convexity and strong concavity ⋮ Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds ⋮ Smooth monotone stochastic variational inequalities and saddle point problems: a survey ⋮ Recent theoretical advances in decentralized distributed convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Optimal Distributed Convex Optimization on Slowly Time-Varying Graphs
• Distributed Subgradient Methods for Multi-Agent Optimization
• Understanding Machine Learning

This page was built for publication: Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks