Pages that link to "Item:Q2452380"
From MaRDI portal
The following pages link to New approximations for the cone of copositive matrices and its dual (Q2452380):
Displayed 16 items.
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- Linear conic formulations for two-party correlations and values of nonlocal games (Q517312) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Approximation hierarchies for the cone of flow matrices (Q1742241) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- 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)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← 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)