An algorithm for global minimization of linearly constrained quadratic functions
From MaRDI portal
Recommendations
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- scientific article; zbMATH DE number 3922383
- Global minimization algorithms for concave quadratic programming problems
- scientific article; zbMATH DE number 4133837
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- A global optimization algorithm for indefinite quadratically constrained quadratic programs
- An effective global optimization algorithm for quadratic programs with quadratic constraints
Cited in
(26)- Global minimization of indefinite quadratic problems
- A multivariate global optimization using linear bounding functions
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Algorithm and separating method for the optimisation of quadratic functions
- New quadratic lower bound for multivariate functions in global optimization
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- scientific article; zbMATH DE number 4133837 (Why is no real title available?)
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- Performance of approximate algorithms for global minimization
- scientific article; zbMATH DE number 3922383 (Why is no real title available?)
- scientific article; zbMATH DE number 1127083 (Why is no real title available?)
- A canonical dual approach for solving linearly constrained quadratic programs
- scientific article; zbMATH DE number 2167564 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 5270607 (Why is no real title available?)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
This page was built for publication: An algorithm for global minimization of linearly constrained quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579950)
