Pages that link to "Item:Q3938843"
From MaRDI portal
The following pages link to Quadratically constrained quadratic programming: Some applications and a method for solution (Q3938843):
Displaying 19 items.
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints (Q1206605) (← links)
- Quadratically constrained convex quadratic programmes: Faculty feasible regions (Q1278283) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
- Controlled perturbations for quadratically constrained quadratic programs (Q4726047) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
