Open problems in the theory of completely positive and copositive matrices
From MaRDI portal
Publication:3448166
Recommendations
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- scientific article; zbMATH DE number 1933860
- Complete positivity
- Copositive matrices, copositive programming, and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
Cited in
(38)- Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- scientific article; zbMATH DE number 7404610 (Why is no real title available?)
- Lower bounds for maximal cp-ranks of completely positive matrices and tensors
- On equivalent representations and properties of faces of the cone of copositive matrices
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Strictly copositive matrices and ESS's
- Linear mappings preserving the completely positive rank
- Rational factorizations of completely positive matrices
- On almost semimonotone matrices with non-positive off-diagonal elements and their generalizations
- Completely positive factorization by a Riemannian smoothing method
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- A random copositive matrix is completely positive with positive probability
- Perfect copositive matrices
- Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
- Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
- A bound on the Carathéodory number
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- A factorization method for completely positive matrices
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Building a completely positive factorization
- The cone of \(5 \times 5\) completely positive matrices
- Tensor decompositions on simplicial complexes with invariance
- Completely positive cones: are they facially exposed?
- Linear preservers of copositive matrices
- Linear mappings preserving the copositive cone
- Faces of the \(5\times 5\) completely positive cone
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- On the number of CP factorizations of a completely positive matrix
- Symmetric nonnegative matrix trifactorization
- The integer cp-rank of \(2 \times 2\) matrices
- Non-exposed polyhedral faces of the completely positive cone
- Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
- The maximal angle between \(5 \times 5\) positive semidefinite and \(5 \times 5\) nonnegative matrices
- New results on the cp-rank and related properties of co(mpletely) positive matrices
This page was built for publication: Open problems in the theory of completely positive and copositive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448166)
