3 citations · 8 across the 20 of their papers we have counts for
Showing 2025 · math.OCShow all
2 papers · 2 filters
math.OC2025
Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
Masakazu Kojima, Sunyoung Kim, Naohiko Arima
A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank- optimal solution that corresponds to an optimal solution of the QCQ…
math.OC2025
Constructing QCQP Instances Equivalent to Their SDP Relaxations
Masakazu Kojima, Naohiko Arima, Sunyoung Kim
General quadratically constrained quadratic programs (QCQPs) are challenging to solve as they are known to be NP-hard. A popular approach to approximating QCQP solutions is to use…