A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization |
scientific article; zbMATH DE number 3930736 |
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
0 references
0 references
0 references
0.8767985701560974
0 references
0.8492639064788818
0 references
