Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance. The first class of problems finds two minimum norm vectors in N -dimensional real or complex Euclide...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of the Operations Research Society of China (Internet) Vol. 4; no. 2; pp. 205 - 221
Main Authors:	Xu, Zi, Hong, Ming-Yi
Format:	Journal Article
Language:	English
Published:	Beijing Operations Research Society of China 01.06.2016 Springer Nature B.V
Subjects:	Algorithms Approximation Constraints Continuity (mathematics) Euclidean geometry Management Science Mathematics Mathematics and Statistics Operations Research Quadratic programming Quality of service Semidefinite programming 90C20 NP-hard Nonconvex quadratically constrained quadratic programming Semidefinite program relaxation 90C22 90C59 Approximation bound
ISSN:	2194-668X, 2194-6698
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!