Pages that link to "Item:Q2448160"
From MaRDI portal
The following pages link to Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160):
Displayed 6 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)