Pages that link to "Item:Q2436642"

The following pages link to Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642):

Displaying 16 items.

• Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Interiors of completely positive cones (Q897047) (← links)
• Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• A simplex algorithm for rational cp-factorization (Q2020599) (← links)
• A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
• Bounding the separable rank via polynomial optimization (Q2144234) (← links)
• Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
• A factorization method for completely positive matrices (Q2174498) (← links)
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
• The CP-Matrix Approximation Problem (Q2790067) (← links)
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• Dehomogenization for completely positive tensors (Q6107957) (← links)