Global minimization of indefinite quadratic problems (Q1092620): Difference between revisions
From MaRDI portal
Latest revision as of 12:41, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global minimization of indefinite quadratic problems |
scientific article |
Statements
Global minimization of indefinite quadratic problems (English)
0 references
1987
0 references
A branch and bound algorithm is proposed for finding the global optimum of large-scale indefinite quadratic problems over a polytope. The algorithm uses separable programming and techniques from concave optimization to obtain approximate solutions. Results on error bounding are given and preliminary computational results using the Cray 1 S supercomputer are reported.
0 references
constrained global optimization
0 references
indefinite quadratic programming
0 references
branch and bound algorithm
0 references
global optimum
0 references
large-scale indefinite quadratic problems
0 references
concave optimization
0 references
error bounding
0 references
0 references
