Quadratic problems defined on a convex hull of points

DOI10.1007/BF01934095MaRDI QIDQ1102708zbMATH OpenOpenAlexFDO

Authors 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

convex programmingglobal minimumglobal optimizationquadratic programmingsuccessive simplex partitions

Mathematics Subject Classification ID

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

Recommendations

• Minimization of convex functions on the convex hull of a point set
• scientific article; zbMATH DE number 3920202
• scientific article; zbMATH DE number 3936940
• An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints

Cites work

• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• An algorithm for nonconvex programming problems
• Constrained global optimization: algorithms and applications
• scientific article; zbMATH DE number 3561096 (Why is no real title available?)
• Methods for Global Concave Minimization: A Bibliographic Survey
• Optimal scaling of balls and polyhedra

Cited in

(6)

• scientific article; zbMATH DE number 3920202 (Why is no real title available?)
• scientific article; zbMATH DE number 3936940 (Why is no real title available?)
• scientific article; zbMATH DE number 165579 (Why is no real title available?)
• The recommender problem with convex hulls
• Algorithms for the solution of quadratic knapsack problems
• Global optimization algorithms for linearly constrained indefinite quadratic problems

This page was built for publication: Quadratic problems defined on a convex hull of points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102708)