Proximal gradient methods with adaptive subspace sampling
Year of publication: |
2021
|
---|---|
Authors: | Grishchenko, Dmitry ; Iutzeler, Franck ; Malick, Jérôme |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 46.2021, 4, p. 1303-1323
|
Subject: | identification | nonsmooth optimization | proximal gradient algorithm | randomized methods | Theorie | Theory | Stichprobenerhebung | Sampling | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A sample approximation solution procedure for chance-constrained districting problems
Baldassarre, Silvia, (2023)
-
Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
Philpott, A. B., (2012)
-
Solving quality control problems with an algorithm for minimax programs with coupled constraints
Duarte, Belmiro P. M., (2014)
- More ...
-
Prices stabilization for inexact unit-commitment problems
Zaourar, Sofia, (2013)
-
Descentwise inexact proximal algorithms for smooth optimization
Fuentes, Marc, (2012)
-
Prices stabilization for inexact unit-commitment problems
Zaourar, Sofia, (2013)
- More ...