A polynomial-time algorithm for computing low CP-rank decompositions
From MaRDI portal
Recommendations
- Decomposition of homogeneous polynomials with low rank
- New lower bounds and asymptotics for the cp-rank
- A note on the computation of the CP-rank
- Some structural properties of low-rank matrices related to computational complexity
- A simplex algorithm for rational cp-factorization
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Computing lower rank approximations of matrix polynomials
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- A Practical Randomized CP Tensor Decomposition
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
Cites work
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 6607459 (Why is no real title available?)
- A Test of the Markovian Model of DNA Evolution
- A note on the computation of the CP-rank
- A note on upper bounds on the cp-rank
- An almost optimal algorithm for computing nonnegative rank
- Bipartite completely positive matrices
- Computing a nonnegative matrix factorization -- provably
- Computing symmetric nonnegative rank factorizations
- Linear-time complete positivity detection and decomposition of sparse matrices
- Matrix Analysis
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- Nonnegative factorization of positive semidefinite nonnegative matrices
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On nonnegative factorization of matrices
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- On the combinatorial and algebraic complexity of quantifier elimination
- On the complexity of nonnegative matrix factorization
- On the computation of \(C^*\) certificates
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the parameterization of the CreditRisk\(^+\) model for estimating credit portfolio risk
- Solving systems of polynomial inequalities in subexponential time
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- The maximal cp-rank of rank \(k\) completely positive matrices
- The structure of completely positive matrices according to their CP-rank and CP-plus-rank
Cited in
(7)- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
- A simplex algorithm for rational cp-factorization
- Binary component decomposition. I: The positive-semidefinite case
- Computing approximate PSD factorizations
- A note on the computation of the CP-rank
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Linear-time complete positivity detection and decomposition of sparse matrices
This page was built for publication: A polynomial-time algorithm for computing low CP-rank decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344517)
