On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
Year of publication: |
February 2016
|
---|---|
Authors: | Shefi, Ron ; Teboulle, Marc |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 4.2016, 1, p. 27-46
|
Subject: | Non-smooth convex minimization | Alternating proximal methods | Coordinate descent | Non-asymptotic rate of convergence | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Fast best subset selection : coordinate descent and local combinatorial optimization algorithms
Hazimeh, Hussein, (2020)
-
Derivation of coordinate descent algorithms from optimal control theory
Ross, Isaac M., (2023)
-
Matrix completion under interval uncertainty
Mareček, Jakub, (2017)
- More ...
-
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)
-
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, Amir, (2003)
- More ...