Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-005-4386-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042642065 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 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
