Pages that link to "Item:Q1037359"
From MaRDI portal
The following pages link to On the computation of \(C^*\) certificates (Q1037359):
Displaying 16 items.
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← 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 factorization method for completely positive matrices (Q2174498) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Accuracy Certificates for Computational Problems with Convex Structure (Q3169082) (← links)
- Interior points of the completely positive cone (Q3497912) (← 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)
