The following pages link to The CP-matrix completion problem (Q2877082):
Displaying 14 items.
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- The copositive completion problem: unspecified diagonal entries (Q865456) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Building a completely positive factorization (Q1787912) (← 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)
- The copositive completion problem (Q2568369) (← links)
- The CP-matrix approximation problem (Q2790067) (← links)
- Completely Positive Binary Tensors (Q5108231) (← links)
- Dehomogenization for completely positive tensors (Q6107957) (← links)