New Lower Bounds and Asymptotics for the cp-Rank
From MaRDI portal
Publication:3453428
DOI10.1137/140973207zbMath1326.15050OpenAlexW1991320936MaRDI QIDQ3453428
Reinhard Ullrich, Werner Schachinger, Immanuel M. Bomze
Publication date: 27 November 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/633900757d8ebda9211f0337679cd9d4773d1b01
Factorization of matrices (15A23) Convex programming (90C25) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (26)
Preservers of the cp-rank ⋮ Matrices with high completely positive semidefinite rank ⋮ Matrix product constraints by projection methods ⋮ On the DJL conjecture for order 6 ⋮ A fresh CP look at mixed-binary QPs: new formulations and relaxations ⋮ Approximate completely positive semidefinite factorizations and their ranks ⋮ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Correlation matrices, Clifford algebras, and completely positive semidefinite rank ⋮ The structure of completely positive matrices according to their CP-rank and CP-plus-rank ⋮ Completely positive matrices: real, rational, and integral ⋮ Bounds for the completely positive rank of a symmetric matrix over a tropical semiring ⋮ Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches ⋮ The extreme rays of the \(6\times 6\) copositive cone ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ Extremal copositive matrices with minimal zero supports of cardinality two ⋮ Completely positive semidefinite rank ⋮ Building a completely positive factorization ⋮ Unnamed Item ⋮ The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem ⋮ The DJL Conjecture for CP Matrices over Special Inclines ⋮ Unnamed Item ⋮ Semialgebraic Geometry of Nonnegative Tensor Rank ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
This page was built for publication: New Lower Bounds and Asymptotics for the cp-Rank
