Quadratic problems defined on a convex hull of points
The problem under consideration is to find the global minimum of a quadratic function over convex hull of a given set of points. By splitting the objective function into a sum of a convex and a concave function, an initial convex underestimating function is constructed. By using successive simplex partitions, further convex underestimation functions are obtained for which the global minimizers can be evaluated. These points approximate the global optimum of the original problem.
scientific article; zbMATH DE number 4050868