Pages that link to "Item:Q2301196"
From MaRDI portal
The following pages link to Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196):
Displaying 9 items.
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Symmetric tensor approximation hierarchies for the completely positive cone (Q2866209) (← links)
- (Q5054600) (← links)
- A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
- On the longest chain of faces of the completely positive and copositive cones (Q6592915) (← links)
