A method of global optimization for indefinite quadratic programming problems
From MaRDI portal
Recommendations
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- A new global optimization algorithm for indefinite quadratic programs
- Global minimization of indefinite quadratic problems
- A new branch-and-bound algorithm for indefinite quadratic programming problems
- A new algorithm for finding global solution of indefinite quadratic programming problems
Cited in
(11)- A decomposition method for global and local quadratic minimization
- On global optimization with indefinite quadratics
- A modified quasisecant method for global optimization
- A new global optimization algorithm for indefinite quadratic programs
- scientific article; zbMATH DE number 484155 (Why is no real title available?)
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- A new algorithm for finding global solution of indefinite quadratic programming problems
- A global optimization algorithm for indefinite quadratically constrained quadratic programs
- scientific article; zbMATH DE number 7647868 (Why is no real title available?)
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- A computational comparison of some branch and bound methods for indefinite quadratic programs
This page was built for publication: A method of global optimization for indefinite quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110424)
