Pages that link to "Item:Q854849"

The following pages link to A note on the computation of the CP-rank (Q854849):

Displaying 17 items.

• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
• Computing symmetric nonnegative rank factorizations (Q651217) (← links)
• The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• On the computation of \(C^*\) certificates (Q1037359) (← links)
• Real rank versus nonnegative rank (Q1039742) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• Completely positive matrices: real, rational, and integral (Q1994053) (← links)
• A simplex algorithm for rational cp-factorization (Q2020599) (← links)
• Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• Copositive Programming (Q2802526) (← links)
• Semialgebraic Geometry of Nonnegative Tensor Rank (Q2834690) (← links)