Pages that link to "Item:Q1037359"
From MaRDI portal
The following pages link to On the computation of \(C^*\) certificates (Q1037359):
Displayed 5 items.
- 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)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)