Pages that link to "Item:Q2144550"
From MaRDI portal
The following pages link to Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550):
Displaying 4 items.
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Algorithm 996 (Q4960955) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)