Exact SDP relaxations of quadratically constrained quadratic programs with forest structures

We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data matrices of a QCQP with n variables, the rank and positive semidefiniteness of the matrix are examined. We prove that if t...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 82; no. 2; pp. 243 - 262
Main Authors:	Azuma, Godai, Fukuda, Mituhiro, Kim, Sunyoung, Yamashita, Makoto
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2022 Springer Springer Nature B.V
Subjects:	Computer Science Constraints Feasibility Mathematical analysis Mathematics Mathematics and Statistics Matrices (mathematics) Operations Research/Decision Theory Optimization Real Functions Semidefinite programming Sparsity Exact semidefinite relaxations Quadratically constrained quadratic programs The rank of aggregated sparsity matrix Forest graph
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!