Alternating and parallel proximal gradient methods for nonsmooth, nonconvex minimax : a unified convergence analysis
Year of publication: |
2025
|
---|---|
Authors: | Cohen, Eyal ; Teboulle, Marc |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 50.2025, 1, p. 141-168
|
Subject: | Bregman distance | convergence rate | global convergence | Kurdyka–Lojasiewicz property | nonconvex nonsmooth minimax | nonsmooth minimization-maximization | proximal gradient method | Theorie | Theory | Wirtschaftliche Konvergenz | Economic convergence | Mathematische Optimierung | Mathematical programming |
-
On geometric convergence rate of Markov search towards the fat target
Tarłowski, Dawid, (2018)
-
A novel method for finding minimum-norm solutions to pseudomonotone variational inequalities
Duong Viet Thong, (2023)
-
Convergence analysis of a subsampled Levenberg-Marquardt algorithm
Xing, Ganchen, (2023)
- More ...
-
Production to order and off-line inspection when the production process is partially observable
Grosfeld-Nir, Abraham, (2007)
-
A conditional gradient method with linear rate of convergence for solving convex linear systems
Beck, Amir, (2004)
-
A conditional gradient method with linear rate of convergence for solving convex linear systems
Beck, Amir, (2004)
- More ...