Pages that link to "Item:Q2397094"
From MaRDI portal
The following pages link to Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094):
Displaying 7 items.
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- 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)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
