BBCPOP
From MaRDI portal
Software:43468
No author found.
Related Items (6)
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ ADMM for the SDP relaxation of the QAP ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
This page was built for software: BBCPOP
