Some problems of solving Lipschitzian global optimization problems using the branch and bound method (Q1803120)
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: Some problems of solving Lipschitzian global optimization problems using the branch and bound method |
scientific article; zbMATH DE number 220258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some problems of solving Lipschitzian global optimization problems using the branch and bound method |
scientific article; zbMATH DE number 220258 |
Statements
Some problems of solving Lipschitzian global optimization problems using the branch and bound method (English)
0 references
29 June 1993
0 references
A branch-and-bound procedure is given for solving a global optimization problem including Lipschitzian functions (moreover, in order to get an easy formula for Lipschitz-constants, the functions should be sufficiently smooth). Using this algorithm \(\varepsilon\)-optimal solutions are obtained.
0 references
branch-and-bound
0 references
global optimization
0 references
Lipschitzian functions
0 references
\(\varepsilon\)-optimal solutions
0 references
0.9072961807250975
0 references
0.8385007381439209
0 references
0.8330683708190918
0 references
