On solving large-scale polynomial convex problems by randomized first-order algorithms
Year of publication: |
2015
|
---|---|
Authors: | Ben-Tal, Aharon ; Nemirovskij, Arkadij S. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 2, p. 474-494
|
Subject: | convex-concave saddle point problems | large-scale convex programming | first order optimization algorithms | acceleration by randomization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Ben-Tal, Aharon, (2009)
-
Accuracy certificates for computational problems with convex structure
Nemirovskij, Arkadij S., (2010)
-
Sparse non Gaussian component analysis by semidefinite programming
Diederichs, Elmar, (2011)
- More ...