The CP-Matrix Completion Problem
From MaRDI portal
Publication:2877082
DOI10.1137/130919490zbMath1298.15037arXiv1305.0632OpenAlexW2075654804MaRDI QIDQ2877082
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
matrix completionsemidefinite programcompletely positive (CP) matricesE-matricesE-truncated \(\Delta\)-moment problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Completely positive tensor recovery with minimal nuclear value ⋮ Partially positive matrices ⋮ Dehomogenization for completely positive tensors ⋮ Interiors of completely positive cones ⋮ Completely Positive Binary Tensors ⋮ \(\{0,1\}\) completely positive tensors and multi-hypergraphs ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ The CP-Matrix Approximation Problem ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices
This page was built for publication: The CP-Matrix Completion Problem
