A simulated annealing driven multi-start algorithm for bound constrained global optimization (Q847248)
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 simulated annealing driven multi-start algorithm for bound constrained global optimization |
scientific article; zbMATH DE number 5669204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simulated annealing driven multi-start algorithm for bound constrained global optimization |
scientific article; zbMATH DE number 5669204 |
Statements
A simulated annealing driven multi-start algorithm for bound constrained global optimization (English)
0 references
12 February 2010
0 references
simulated annealing
0 references
positive spanning direction
0 references
direct search methods
0 references
pattern search
0 references
global optimization
0 references
multi-level single linkage
0 references
derivative-free
0 references
multi-start algorithm
0 references
convergence
0 references
numerical results
0 references
numerical comparisons
0 references
0 references
0 references
0 references
0.8049214482307434
0 references
0.8047646880149841
0 references
0.7931006550788879
0 references
0.7900111079216003
0 references
0.7771267890930176
0 references
