The CP-matrix completion problem

DOI10.1137/130919490MaRDI QIDQ2877082zbMATH OpenOpenAlexFDO

Authors Anwa Zhou, Jinyan Fan

Publication date 21 August 2014

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

Full work available at URL https://arxiv.org/abs/1305.0632

zbMATH Keywords

completely positive (CP) matricesE-matricesE-truncated \(\Delta\)-moment problemmatrix completionsemidefinite program

Mathematics Subject Classification ID

Matrix completion problems (15A83) Positive matrices and their generalizations; cones of matrices (15B48) Semidefinite programming (90C22)

Abstract: A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=B{B}^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e., a matrix having unknown entries) such that the completed matrix is completely positive. We propose a semidefinite algorithm for solving general CP-completion problems, and study its properties. When all the diagonal entries are given, the algorithm can give a certificate if a partial matrix is not CP-completable, and it almost always gives a CP-completion if it is CP-completable. When diagonal entries are partially given, similar properties hold. Computational experiments are also presented to show how CP-completion problems can be solved.

Review text

After an introduction of truncated moment problems, the authors present a semidefinite algorithm for solving general CP-completion problems. Its basic properties are also studied. Further, properties of CP-completion problems when some diagonal entries are missing are analyzed. Computational results along with some applications are also given.

Recommendations

• The CP-matrix approximation problem
• The completely positive and doubly nonnegative completion problems
• The copositive completion problem
• Completely positive matrices.
• Building a completely positive factorization

Cited in

(17)

• Completely positive tensor recovery with minimal nuclear value
• Building a completely positive factorization
• A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
• A semidefinite relaxation algorithm for checking completely positive separable matrices
• The copositive completion problem
• The CP-matrix approximation problem
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Matrix completions, moments, and sums of Hermitian squares
• The completely positive and doubly nonnegative completion problems
• \(\{0,1\}\) completely positive tensors and multi-hypergraphs
• Completely positive binary tensors
• A semidefinite algorithm for completely positive tensor decomposition
• Dehomogenization for completely positive tensors
• Linear optimization with cones of moments and nonnegative polynomials
• The copositive completion problem: unspecified diagonal entries
• Partially positive matrices
• Interiors of completely positive cones

This page was built for publication: The CP-matrix completion problem

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