DOGT and its accelerated variant ADOGT achieve optimal communication complexity O(κ log(1/ε)/√(1-√ρ_W)) for distributed strongly convex-strongly concave minimax optimization over networks.
Distributed optimization for control,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An Optimistic Gradient Tracking Method for Distributed Minimax Optimization
DOGT and its accelerated variant ADOGT achieve optimal communication complexity O(κ log(1/ε)/√(1-√ρ_W)) for distributed strongly convex-strongly concave minimax optimization over networks.