Normal conical algorithm for concave minimization over polytopes (Q1177231): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:43, 29 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Normal conical algorithm for concave minimization over polytopes |
scientific article |
Statements
Normal conical algorithm for concave minimization over polytopes (English)
0 references
26 June 1992
0 references
The class of conical algorithms, introduced in 1964 by the author, designed to find the global minimum of a concave function over a polytope uses valid cuts to exclude parts of the feasible domain, while partitioning the latter through an exhaustive subdivision cone splitting process. To ensure faster convergence and overcome some major drawbacks a sufficient convergence condition for the class of conical algorithms is given, and on the basis of this condition a new algorithm, called ``normal'', which is easy to implement and performs better in solving moderate size \((n\leq 50)\) problems on microcomputers, is presented.
0 references
concave minimization over polytopes
0 references
bisection
0 references
normal subdivision process
0 references
conical algorithms
0 references
convergence condition
0 references