Faster, but weaker, relaxations for quadratically constrained quadratic programs

We introduce a new relaxation framework for nonconvex quadratically constrained quadratic programs (QCQPs). In contrast to existing relaxations based on semidefinite programming (SDP), our relaxations incorporate features of both SDP and second order cone programming (SOCP) and, as a result, solve m...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computational optimization and applications Ročník 59; číslo 1-2; s. 27 - 45
Hlavní autoři:	Burer, Samuel, Kim, Sunyoung, Kojima, Masakazu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.10.2014 Springer Nature B.V
Témata:	Analysis Blocking Computation Computer science Constraints Convex and Discrete Geometry Linear programming Management Science Mathematical analysis Mathematical programming Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Programming Quadratic programming Semidefinite programming Statistics Studies Semidefinite programming Nonconvex quadratic programming Second-order cone programming Difference of convex
ISSN:	0926-6003, 1573-2894
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!