A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q586526 |
Changed an Item |
||
| Property / author | |||
| Property / author: Reiner Horst / rank | |||
Normal rank | |||
Revision as of 06:25, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization |
scientific article |
Statements
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (English)
0 references
1986
0 references
Based on a review of existing algorithms, a general branch-and-bound concept in global optimization is presented. A sufficient and necessary convergence condition is established, and a broad class of realizations is derived that include existing and several new approaches for concave minimization problems.
0 references
branch-and-bound
0 references
global optimization
0 references
sufficient and necessary convergence condition
0 references
concave minimization
0 references
nonconvex programming
0 references
