Quadratic problems defined on a convex hull of points (Q1102708): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal scaling of balls and polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for nonconvex programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Methods for Global Concave Minimization: A Bibliographic Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constrained global optimization: algorithms and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4132018 / rank | |||
Normal rank | |||
Revision as of 16:15, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic problems defined on a convex hull of points |
scientific article |
Statements
Quadratic problems defined on a convex hull of points (English)
0 references
1988
0 references
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.
0 references
quadratic programming
0 references
convex programming
0 references
global optimization
0 references
global minimum
0 references
successive simplex partitions
0 references
0 references
