Pages that link to "Item:Q868634"
From MaRDI portal
The following pages link to A linear programming reformulation of the standard quadratic optimization problem (Q868634):
Displaying 9 items.
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
