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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 59; H. 1-2; S. 27 - 45
Hauptverfasser:	Burer, Samuel, Kim, Sunyoung, Kojima, Masakazu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.10.2014 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!