Cited in
(7)- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- ADMM for the SDP relaxation of the QAP
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- MIQCR-CB
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- A Newton-bracketing method for a simple conic optimization problem
This page was built for software: BBCPOP
