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 | Nichtlineare Optimierung | Nonlinear programming | Robustes Verfahren | Robust statistics | Schätztheorie | Estimation theory |
-
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
Goberna, M. A., (2018)
-
Fakhar, Majid, (2018)
-
Global sensitivity analysis via a statistical tolerance approach
Curry, Stewart, (2022)
- More ...
-
Wang, Zhenbo, (2009)
-
A successive approximation algorithm for the multiple knapsack problem
Wang, Zhenbo, (2009)
-
Worst-case analysis for on-line service policies
Wang, Zhenbo, (2010)
- More ...