Maximizing perturbation radii for robust convex quadratically constrained quadratic programs
Year of publication: |
2021
|
---|---|
Authors: | Yu, Pengfei ; Gao, Ruotian ; Xing, Wenxun |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 293.2021, 1 (16.8.), p. 50-64
|
Subject: | Convex programming | Linear conic programming | Quadratically constrained quadratic programming | Robustness and sensitivity analysis | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Nichtlineare Optimierung | Nonlinear programming | Robustes Verfahren | Robust statistics |
-
Fakhar, Majid, (2018)
-
Goberna, Miguel A., (2022)
-
Procurement strategy with credit risk
Wang, Hsiao-fan, (2013)
- More ...
-
New trends in parallel machine scheduling
Lam, Kokin, (1997)
-
Canonical dual approach to solving the maximum cut problem
Wang, Zhenbo, (2012)
-
A canonical dual approach for solving linearly constrained quadratic programs
Xing, Wenxun, (2012)
- More ...