The following pages link to BBCPOP (Q43468):
Displaying 7 items.
- (Q47462) (redirect page) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
