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 20 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← 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)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Quadratic optimization over one first-order cone (Q2438413) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
- Solving conic quadratically constrained quadratic programming problems (Q2928413) (← links)
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620) (← links)
- (Q5148989) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming (Q5408222) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
