3 papers
math.OC2023
Exact Matrix Completion via High-Rank Matrices in Sum-of-Squares Relaxations
Godai Azuma, Sunyoung Kim, Makoto Yamashita
We study exact matrix completion from partially available data with hidden connectivity patterns. Exact matrix completion was shown to be possible recently by Cosse and Demanet in…
math.OC2022
Exact SDP relaxations for quadratic programs with bipartite graph structures
Godai Azuma, Mituhiro Fukuda, Sunyoung Kim +1
For nonconvex quadratically constrained quadratic programs (QCQPs), we first show that, under certain feasibility conditions, the standard semidefinite (SDP) relaxation is exact fo…
math.OC2020
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Godai Azuma, Mituhiro Fukuda, Sunyoung Kim +1
We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data ma…