A new heuristic approach for non-convex optimization problems (Q985056)
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: A new heuristic approach for non-convex optimization problems |
scientific article; zbMATH DE number 5758507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new heuristic approach for non-convex optimization problems |
scientific article; zbMATH DE number 5758507 |
Statements
A new heuristic approach for non-convex optimization problems (English)
0 references
20 July 2010
0 references
heuristic Kalman algorithm
0 references
non-convex optimization
0 references
metaheuristic
0 references
objective function
0 references
almost sure convergence
0 references
0 references
0 references
0 references
0.92514086
0 references
0.91883576
0 references
0.9136362
0 references
0.90972644
0 references
0.89930284
0 references
0.8967614
0 references
0.8952516
0 references
0.89496654
0 references
