Pages that link to "Item:Q1716972"

The following pages link to Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972):

Displaying 2 items.

• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)