Pages that link to "Item:Q2790067"
From MaRDI portal
The following pages link to The CP-matrix approximation problem (Q2790067):
Displaying 8 items.
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Symmetric tensor approximation hierarchies for the completely positive cone (Q2866209) (← links)
- The CP-matrix completion problem (Q2877082) (← links)
- Dehomogenization for completely positive tensors (Q6107957) (← links)