Pages that link to "Item:Q2020599"
From MaRDI portal
The following pages link to A simplex algorithm for rational cp-factorization (Q2020599):
Displayed 4 items.
- Bounding the separable rank via polynomial optimization (Q2144234) (← 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)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
