A finite algorithm for solving general quadratic problems
A global optimization procedure for indefinite quadratic problems over a polyhedron in \(\mathbb{R}^ n\) is developed. In nondegenerate situations the procedure is shown to be finite and exact. The paper is organized as follows: Section 1: Introduction; Section 2: Escaping from local solutions; Section 3: Using pseudoconvexity to improve efficiency; Section 4: A finite global optimization procedure. In Section 4 an example is given. The procedure proposed uses the simplex algorithm.
scientific article; zbMATH DE number 513302
scientific article