Showing 2026Show all
2 papers · 1 filter
math.OC2026
Local-to-Global Exactness of SDP Relaxations for Sparse QCQPs
Masakazu Kojima, Sunyoung Kim, Naohiko Arima
We study exact semidefinite programming (SDP) relaxation for a given sparse quadratically constrained quadratic program (QCQP). The SDP relaxation is exact if, whenever it has an o…
math.OC2026
Separable QCQPs and Their Exact SDP Relaxations
Masakazu Kojima, Sunyoung Kim, Naohiko Arima
This paper studies exact semidefinite programming relaxations (SDPRs) for separable quadratically constrained quadratic programs (QCQPs). We consider the construction of a larger s…