Outer approximation by polyhedral convex sets (Q1101351)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Outer approximation by polyhedral convex sets |
scientific article; zbMATH DE number 4047461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Outer approximation by polyhedral convex sets |
scientific article; zbMATH DE number 4047461 |
Statements
Outer approximation by polyhedral convex sets (English)
0 references
1987
0 references
This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of \textit{B. C. Eaves} and \textit{W. I. Zangwill} [SIAM J. Control 9, 529-542 (1971)]. Two constraint dropping strategies are deduced.
0 references
outer approximation
0 references
multiextremal global optimization
0 references
polyhedral convex sets
0 references
cut map-separator theory
0 references
constraint dropping strategies
0 references
0 references
0.9240891
0 references
0.9204176
0 references
0.9086235
0 references
