Concave minimization via conical partitions and polyhedral outer approximation (Q811411): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concave minimization via conical partitions and polyhedral outer approximation |
scientific article |
Statements
Concave minimization via conical partitions and polyhedral outer approximation (English)
0 references
1991
0 references
The paper deals with a so-called concave minimization problem, i.e. with minimizing a concave function over a convex compact set in \(R^ n\). An algorithm is introduced, which combines branch-and-bound elements with cutting planes. A convergence theorem is proved. Preliminary computer implementations and performance comparisons with earlier methods are reported.
0 references
concave minimization
0 references
branch-and-bound
0 references
cutting planes
0 references
convergence
0 references
