Outer approximation by polyhedral convex sets (Q1101351): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:37, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Outer approximation by polyhedral convex sets |
scientific article |
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
