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

Full description

Bibliographic Details

Published in:	Journal of global optimization Vol. 70; no. 4; pp. 719 - 735
Main Authors:	Zheng, Xiaojin, Pan, Yutong, Cui, Xueting
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2018 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!