Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems
From MaRDI portal
Publication:6130542
DOI10.1137/23m1558677arXiv2304.02441OpenAlexW4392709902MaRDI QIDQ6130542
Publication date: 3 April 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.02441
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gradient methods for minimizing composite functions
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Tracking-ADMM for distributed constraint-coupled optimization
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributionally Robust Convex Optimization
- Multiuser Optimization: Distributed Algorithms and Error Analysis
- Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning
- First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems
- Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
- Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- The Theory of Max-Min, with Applications
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
This page was built for publication: Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems
