Quadratic problems defined on a convex hull of points

DOI10.1007/BF01934095zbMath0644.65036OpenAlexW1966554610MaRDI QIDQ1102708

Panos M. Pardalos

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934095

zbMATH Keywords

global optimizationquadratic programmingconvex programmingglobal minimumsuccessive simplex partitions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

Algorithms for the solution of quadratic knapsack problems, Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Constrained global optimization: algorithms and applications
• Methods for Global Concave Minimization: A Bibliographic Survey
• Optimal scaling of balls and polyhedra
• An algorithm for nonconvex programming problems
• Unnamed Item