Computational experience with a new class of convex underestimators: Box-constrained NLP problems (Q1768613)
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: Computational experience with a new class of convex underestimators: Box-constrained NLP problems |
scientific article; zbMATH DE number 2146087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational experience with a new class of convex underestimators: Box-constrained NLP problems |
scientific article; zbMATH DE number 2146087 |
Statements
Computational experience with a new class of convex underestimators: Box-constrained NLP problems (English)
0 references
15 March 2005
0 references
Branch-and-bound
0 references
convex underestimators
0 references
global optimization
0 references
0.8238153457641602
0 references
0.8008826971054077
0 references
0.7947655320167542
0 references
0.7924594283103943
0 references
0.7882526516914368
0 references
