Quadratic problems defined on a convex hull of points
type: Item
instance of: scholarly article
title: Quadratic problems defined on a convex hull of points
zbMATH Open document ID: 0644.65036
DOI: 10.1007/BF01934095
author: Panos M. Pardalos
published in: BIT
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 4050868
zbMATH Keywords: quadratic programming
zbMATH Keywords: convex programming
zbMATH Keywords: global optimization
zbMATH Keywords: global minimum
zbMATH Keywords: successive simplex partitions
reviewed by: Klaus Schittkowski
MaRDI profile type: Publication
cites work: Optimal scaling of balls and polyhedra
cites work: An algorithm for nonconvex programming problems
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: Methods for Global Concave Minimization: A Bibliographic Survey
cites work: Constrained global optimization: algorithms and applications
cites work: Q4132018
full work available at URL: https://doi.org/10.1007/bf01934095
OpenAlex ID: W1966554610
description: scientific article; zbMATH DE number 4050868