On the Convergence of Proximal Algorithms for Weakly-convex Min-max Optimization
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
We study alternating first-order algorithms with no inner loops for solving nonconvex-strongly concave min-max problems. We show the convergence of the alternating gradient descent-ascent algorithm by proposing a substantially simplified proof compared to previous ones. It allows us to enlarge the set of admissible step-sizes. Building on this general reformulation, we also prove the convergence of a doubly proximal algorithm in the weakly convex-strongly concave setting. Finally, we show how this new result opens the way to new applications of min-max optimization algorithms for solving regularized imaging inverse problems with neural networks in a plug-and-play manner.
Fields of Study & Subjects
Optimization and Variational Analysis
Stochastic Gradient Optimization Techniques
Sparse and Compressive Sensing Techniques
Publication details
- Journal / source
- HAL
- Publication date
- 30 March 2026
- Language
- EN
- Document type
- Preprint