Global minimization of indefinite quadratic problems
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.
large-scale indefinite quadratic problems
scientific article; zbMATH DE number 4020360
scientific article