Distributed saddle point problems: lower bounds, near-optimal and robust algorithms

DOI10.1080/10556788.2025.2463986MaRDI QIDQ6907517zbMATH OpenFDO

Authors Aleksandr Beznosikov, A. V. Gasnikov

Publication date 1 November 2025

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2025.2463986

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Stochastic programming (90C15)

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Distributed Subgradient Methods for Multi-Agent Optimization
• Dual extrapolation and its applications to solving variational inequalities and related problems
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
• Monotone (nonlinear) operators in Hilbert space
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Solving variational inequalities with stochastic mirror-prox algorithm
• Training GANs with centripetal acceleration
• Understanding machine learning. From theory to algorithms

This page was built for publication: Distributed saddle point problems: lower bounds, near-optimal and robust algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907517)