BBCPOP
From MaRDI portal
Software:43468
swMATH31757MaRDI QIDQ43468FDOQ43468
Author name not available (Why is that?)
Cited In (6)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- A Newton-bracketing method for a simple conic optimization problem
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- ADMM for the SDP relaxation of the QAP
This page was built for software: BBCPOP
