Pages that link to "Item:Q4902917"
From MaRDI portal
The following pages link to Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices (Q4902917):
Displayed 15 items.
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← links)
- The complete positivity of symmetric tridiagonal and pentadiagonal matrices (Q2105347) (← links)
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- On the number of CP factorizations of a completely positive matrix (Q5887654) (← links)
- Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
