Complexity results and effective algorithms for worst-case linear optimization under uncertainties
Year of publication: |
2021
|
---|---|
Authors: | Luo, Hezhi ; Ding, Xiaodong ; Peng, Jiming ; Jiang, Rujun ; Li, Duan |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 1, p. 180-197
|
Subject: | worst-case linear optimization | successive convex optimization | convex relaxation | branch-and-bound | computational complexity | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
-
Effective algorithms for optimal portfolio deleveraging problem with cross impact
Luo, Hezhi, (2024)
-
Scheduling reclaimers serving a stock pad at a coal terminal
Kalinowski, Thomas, (2017)
-
Jin, Bo, (2023)
- More ...
-
Effective algorithms for optimal portfolio deleveraging problem with cross impact
Luo, Hezhi, (2024)
-
Quadratic convex reformulation for quadratic programming with linear on-off constraints
Wu, Baiyi, (2019)
-
Portfolio optimization with nonparametric value at risk : a block coordinate descent method
Cui, Xueting, (2018)
- More ...