5 citations · 5 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
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…
Nearly optimal first-order methods for convex optimization under gradient norm measure: An adaptive regularization approach
Masaru Ito, Mituhiro Fukuda
In the development of first-order methods for smooth (resp., composite) convex optimization problems, where smooth functions with Lipschitz continuous gradients are minimized, the…
A dual spectral projected gradient method for log-determinant semidefinite problems
Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim +1
We extend the result on the spectral projected gradient method by Birgin et al. in 2000 to a log-determinant semidefinite problem (SDP) with linear constraints and propose a spectr…