Pages that link to "Item:Q2133420"
From MaRDI portal
The following pages link to On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420):
Displaying 9 items.
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Fixed point theory for permissible extension type maps (Q2269955) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)