Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
From MaRDI portal
Recommendations
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- scientific article; zbMATH DE number 7366738
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A novel optimization method for nonconvex quadratically constrained quadratic programs
Cites work
- A deterministic global optimization algorithm for generalized geometric programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A global optimization algorithm for generalized quadratic programming
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A global optimization algorithm using parametric linearization relaxation
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- Branch-reduction-bound algorithm for generalized geometric programming
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization of generalized geometric programming
- Linearization method of global optimization for generalized geometric programming
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
Cited in
(8)- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
This page was built for publication: Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409582)
