Linear-time complete positivity detection and decomposition of sparse matrices

DOI10.1137/110848177MaRDI QIDQ4902917zbMATH OpenOpenAlexFDO

Authors Peter J. C. Dickinson, Mirjam Dür

Publication date 18 January 2013

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/2474102/2012SIAMJMatrixAnalApplDickinson.pdf

zbMATH Keywords

algorithmcomplete positivitylinear-timerank-one decompositionsparse matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Computational methods for sparse matrices (65F50)

Recommendations

• A polynomial-time algorithm for computing low CP-rank decompositions
• The complete positivity of symmetric tridiagonal and pentadiagonal matrices
• Complete positivity
• A semidefinite relaxation algorithm for checking completely positive separable matrices
• Combinatorial results on completely positive matrices

Cited in

(15)

• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Building a completely positive factorization
• Completely positive matrices: real, rational, and integral
• The complete positivity of symmetric tridiagonal and pentadiagonal matrices
• Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression
• A factorization method for completely positive matrices
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Factorization and cutting planes for completely positive matrices by copositive projection
• A polynomial-time algorithm for computing low CP-rank decompositions
• On the computational complexity of membership problems for the completely positive cone and its dual
• The \(\mathcal A\)-truncated \(K\)-moment problem
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
• On the number of CP factorizations of a completely positive matrix
• Completely positive factorization by a Riemannian smoothing method
• Interiors of completely positive cones

This page was built for publication: Linear-time complete positivity detection and decomposition of sparse matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902917)