Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512)
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: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties |
scientific article; zbMATH DE number 6419114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties |
scientific article; zbMATH DE number 6419114 |
Statements
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (English)
0 references
24 March 2015
0 references
global optimization
0 references
Lipschitzian optimization
0 references
parallel branch and bound
0 references
nonconvex programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
