Exactness conditions for semidefinite programming relaxations of generalization of the extended trust region subproblem
Year of publication: |
2023
|
---|---|
Authors: | Jiang, Rujun ; Li, Duan |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 3, p. 1235-1253
|
Subject: | extended trust region subproblem | quadratically constrained quadratic programming | second order cone programming | semidefinite programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
On solving quadratically contrained quadratic programming problem with one non-convex constraint
Keyanpour, Mohammad, (2018)
-
A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem
Lambert, Amélie, (2024)
-
Semidefinite representable reformulations for two variants of the trust-region subproblem
Kelly, Sarah, (2023)
- More ...
-
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)
-
Complexity results and effective algorithms for worst-case linear optimization under uncertainties
Luo, Hezhi, (2021)
- More ...