Decentralized saddle-point problems with different constants of strong convexity and strong concavity

DOI10.1007/s10287-023-00485-9arXiv2206.00090MaRDI QIDQ6149570

Dmitry Metelev, Alexander Rogozin, A. V. Gasnikov, Dmitry P. Kovalev

Publication date: 6 February 2024

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.00090

zbMATH Keywords

stochastic optimizationsaddle-point problemdecentralized optimizationinexact oracletime-varying graphsconsensus subroutine

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• First-order methods of smooth convex optimization with inexact oracle
• Lectures on convex optimization
• Decentralized convex optimization under affine constraints for power systems control
• Accelerated methods for saddle-point problem
• First-order and stochastic optimization methods for machine learning
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Accelerated Optimization for Machine Learning
• Optimal Algorithms for Non-Smooth Distributed Optimization in Networks
• Accelerated variance-reduced methods for saddle-point problems
• Towards accelerated rates for distributed optimization over time-varying networks
• Recent theoretical advances in decentralized distributed convex optimization
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks

This page was built for publication: Decentralized saddle-point problems with different constants of strong convexity and strong concavity