3 citations · 8 across the 20 of their papers we have counts for
3 papers · 1 filter
A Newton-bracketing method for a simple conic optimization problem
Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
For the Lagrangian-DNN relaxation of quadratic optimization problems (QOPs), we propose a Newton-bracketing method to improve the performance of the bisection-projection method imp…
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
We study the equivalence among a nonconvex QOP, its CPP and DNN relaxations under the assumption that the aggregated and correlative sparsity of the data matrices of the CPP relaxa…
A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with…