Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:29, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improve-and-branch algorithm for the global optimization of nonconvex NLP problems |
scientific article |
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
