Quadratically constrained quadratic programming: Some applications and a method for solution
From MaRDI portal
Cites work
- A Dual Method for Quadratic Programs with Quadratic Constraints
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3537441 (Why is no real title available?)
- scientific article; zbMATH DE number 3363352 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Komplementaritäts- und Fixpunktalgorithmen in der mathematischen Programmierung, Spieltheorie und Ökonomie
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Quadratic programming with quadratic constraints
- The computation of fixed points and applications
Cited in
(19)- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- Reduction of indefinite quadratic programs to bilinear programs
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Compact mixed-integer programming formulations in quadratic optimization
- On the tightness of SDP relaxations of QCQPs
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- On subspace properties of the quadratically constrained quadratic program
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Controlled perturbations for quadratically constrained quadratic programs
- On Convex Hulls of Epigraphs of QCQPs
- Solving generalized polynomial problem by using new affine relaxed technique
- Using general triangle inequalities within quadratic convex reformulation method
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
This page was built for publication: Quadratically constrained quadratic programming: Some applications and a method for solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3938843)
