An optimal subgradient algorithm for large-scale bound-constrained convex optimzation
Year of publication: |
August 2017
|
---|---|
Authors: | Ahookhosh, Masoud ; Neumaier, Arnold |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 86.2017, 1, p. 123-147
|
Subject: | Bound-constrained convex optimization | Nonsmooth optimization | First-order black-box oracle | Subgradient methods | Optimal complexity | High-dimensional data | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Ahookhosh, Masoud, (2019)
-
Solving structured nonsmooth convex optimization with complexity O(ε−1/2)
Ahookhosh, Masoud, (2018)
-
Loreto, M., (2019)
- More ...
-
Solving structured nonsmooth convex optimization with complexity O(ε−1/2)
Ahookhosh, Masoud, (2018)
-
Ahookhosh, Masoud, (2019)
-
AMINI, KEYVAN, (2011)
- More ...