Pages that link to "Item:Q2938346"

The following pages link to New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346):

Displaying 21 items.

• Matrices with high completely positive semidefinite rank (Q344893) (← links)
• From seven to eleven: completely positive matrices with high cp-rank (Q401186) (← links)
• The structure of completely positive matrices according to their CP-rank and CP-plus-rank (Q492774) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← 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)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• The extreme rays of the \(6\times 6\) copositive cone (Q2022227) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
• Robust Quadratic Programming with Mixed-Integer Uncertainty (Q3386756) (← links)
• (Q4568070) (← links)
• Extremal copositive matrices with minimal zero supports of cardinality two (Q4685505) (← links)
• Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls (Q4971384) (← links)
• (Q5124683) (← links)
• On the DJL conjecture for order 6 (Q5346603) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• Preservers of the cp-rank (Q5888830) (← links)
• Approximate completely positive semidefinite factorizations and their ranks (Q6051147) (← links)