Convergent nested alternating minimization algorithms for nonconvex optimization problems
Year of publication: |
2023
|
---|---|
Authors: | Gur, Eyal ; Sabach, Shoham ; Shtern, Shimrit |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 1, p. 53-77
|
Subject: | global convergence | nested algorithms | nonconvex and nonsmooth minimization | nondescent methods | nonsmooth Kurdyka-Łojasiewicz property | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Nonconvex Lagrangian-based optimization : monitoring schemes and global convergence
Bolte, Jérôme, (2018)
-
On the convergence of a smoothed penalty algorithm for semi-infinite programming
Liu, Qian, (2013)
-
Some theoretical limitations of second-order algorithms for smooth constrained optimization
Haeser, G., (2018)
- More ...
-
Technical note: two-stage sample robust optimization
Bertsimas, Dimitris, (2022)
-
A data-driven approach to multistage stochastic linear optimization
Bertsimas, Dimitris, (2023)
-
An adaptive robust optimization model for parallel machine scheduling
Cohen, Izack, (2023)
- More ...