Pages that link to "Item:Q840651"

The following pages link to The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651):

Displaying 21 items.

• Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
• Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
• Copositive optimization -- recent developments and applications (Q421783) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• The extreme rays of the \(5 \times 5\) copositive cone (Q445811) (← links)
• \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
• Computing symmetric nonnegative rank factorizations (Q651217) (← links)
• A note on ``\(5\times 5\) completely positive matrices'' (Q984866) (← links)
• Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• On \(\{0,1\}\) CP tensors and CP pseudographs (Q1790471) (← links)
• Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
• Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• Irreducible elements of the copositive cone (Q2637144) (← links)
• The CP-Matrix Approximation Problem (Q2790067) (← links)
• Copositive Programming (Q2802526) (← links)
• Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
• (Q5054600) (← links)