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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 82; číslo 2; s. 243 - 262
Hlavní autori:	Azuma, Godai, Fukuda, Mituhiro, Kim, Sunyoung, Yamashita, Makoto
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2022 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!