Approximate search for a global minimum in problems of mathematical programming that are close to convex (Q5932899)
From MaRDI portal
scientific article; zbMATH DE number 1601062
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
