Pages that link to "Item:Q1716972"
From MaRDI portal
The following pages link to Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972):
Displaying 4 items.
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)