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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 70; číslo 4; s. 719 - 735
Hlavní autori:	Zheng, Xiaojin, Pan, Yutong, Cui, Xueting
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2018 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!