A novel optimization method for nonconvex quadratically constrained quadratic programs
From MaRDI portal
Recommendations
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- Global optimization for non-convex quadratic programs with additional multiplicative constraints
Cites work
- scientific article; zbMATH DE number 970354 (Why is no real title available?)
- A Cutting Plane Approach for Chance Constrained Linear Programs
- 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 for signomial geometric programming problem
- 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 linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- 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 reformulation-convexification approach for solving nonconvex quadratic programming problems
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A review of recent advances in global optimization
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Bilinear programming and structured stochastic games
- 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
- Global optimization for generalized geometric programming problems with discrete variables
- Handbook of test problems in local and global optimization
- Linear Control of a Markov Production System
- Linearization method of global optimization for generalized geometric programming
- MM algorithms for geometric and signomial programming
- On generalized geometric programming problems with non-positive variables
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Solving a class of geometric programming problems by an efficient dynamic model
Cited in
(19)- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- An unconstrained convex programming approach to solving convex quadratic programming problems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- An efficient algorithm for computing a class of multiplicative optimization problem
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- An LPCC approach to nonconvex quadratic programs
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- A non-interior path following method for convex quadratic programming problems with bound constraints
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- A generalized design approach to solution of the non-convex quadratic programming problem
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- scientific article; zbMATH DE number 1174443 (Why is no real title available?)
This page was built for publication: A novel optimization method for nonconvex quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724769)
