Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (Q3789345)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure |
scientific article; zbMATH DE number 4053357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure |
scientific article; zbMATH DE number 4053357 |
Statements
Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (English)
0 references
1988
0 references
global minimum
0 references
Lipschitz continuous functions
0 references
branch-and-bound
0 references
constrained global minimization
0 references
sequentially generated subintervals
0 references
partition selection
0 references
partition refinement
0 references
convergence
0 references
0 references
0.9072961807250975
0 references
0.8520062565803528
0 references
0.8433039784431458
0 references
