On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for globally minimizing concave functions over convex sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On an outer approximation concept in global optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An outer approximation method for globally minimizing a concave function over a compact convex set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On outer approximation methods for solving concave minimization problems / rank | |||
Normal rank | |||
Latest revision as of 17:18, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding new vertices and redundant constraints in cutting plane algorithms for global optimization |
scientific article |
Statements
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (English)
0 references
1988
0 references
It is known that a number of multiextremal (global) optimization problems can be efficiently solved by cutting plane methods. Here, a new procedure is presented for finding all new vertices of the sequentially generated polytopes. Then it is shown how redundant constraints can be eliminated, knowing the vertex set of a polytope.
0 references
multiextremal optimization
0 references
cutting plane methods
0 references
all new vertices
0 references
sequentially generated polytopes
0 references
redundant constraints
0 references
0 references
