Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

We investigate in this paper nonconvex binary quadratically constrained quadratic programming (QCQP) which arises in various real-life fields. We propose a novel approach of getting quadratic convex reformulation (QCR) for this class of optimization problem. Our approach employs quadratic surrogate...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization Jg. 70; H. 4; S. 719 - 735
Hauptverfasser:	Zheng, Xiaojin, Pan, Yutong, Cui, Xueting
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2018 Springer Springer Nature B.V
Schlagworte:	Computer Science Constraints Mathematics Mathematics and Statistics Nonlinear programming Operations Research/Decision Theory Optimization Quadratic programming Real Functions Semidefinite programming Binary QCQP Semidefinite programming Global optimization Quadratic convex reformulation
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!