Approximate search for a global minimum in problems of mathematical programming that are close to convex (Q5932899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1601062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate search for a global minimum in problems of mathematical programming that are close to convex |
scientific article; zbMATH DE number 1601062 |
Statements
Approximate search for a global minimum in problems of mathematical programming that are close to convex (English)
0 references
18 June 2001
0 references
global minimum
0 references
nonconvex problem
0 references
0.8850464820861816
0 references
0.7943989038467407
0 references
0.7940970063209534
0 references
0.7732114195823669
0 references
