Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301)
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: Improve-and-branch algorithm for the global optimization of nonconvex NLP problems |
scientific article; zbMATH DE number 5035950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improve-and-branch algorithm for the global optimization of nonconvex NLP problems |
scientific article; zbMATH DE number 5035950 |
Statements
Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (English)
0 references
26 June 2006
0 references
concave terms
0 references
convex hull
0 references
underestimating problem
0 references
0 references
0.7874870896339417
0 references
0.7817856669425964
0 references
