An improved characterisation of the interior of the completely positive cone
From MaRDI portal
Publication:3075177
DOI10.13001/1081-3810.1404zbMath1217.15019OpenAlexW167979754MaRDI QIDQ3075177
Publication date: 10 February 2011
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231237
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
On the number of CP factorizations of a completely positive matrix ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ Irreducible elements of the copositive cone ⋮ A factorization method for completely positive matrices ⋮ On the DJL conjecture for order 6 ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Interiors of completely positive cones ⋮ Separation and relaxation for cones of quadratic forms ⋮ The cone of \(5 \times 5\) completely positive matrices ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositive programming via semi-infinite optimization ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ Nearly positive matrices ⋮ The structure of completely positive matrices according to their CP-rank and CP-plus-rank ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ Geometry of the copositive and completely positive cones ⋮ Quadratic factorization heuristics for copositive programming ⋮ Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches ⋮ A simplex algorithm for rational cp-factorization ⋮ Building a completely positive factorization ⋮ \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ Sign patterns of inverse doubly nonnegative matrices and inverse completely positive matrices
