No label defined (Q3768665)
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 4027156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4027156 |
Statements
1985
0 references
quasi-optimal schedules
0 references
undirected random search
0 references
local optimization
0 references
0.7497624158859253
0 references
0.7095196843147278
0 references
[For the entire collection see Zbl 0627.00021.] In another paper [see the preceding review] we considered the basic methods of devising quasi-optimal schedules based on undirected random search. The main shortcoming of the method is its relatively slow convergence to the optimal schedule. The convergence can be accelerated by modifying the random search so that separate random tests are dependent. We can employ methods of local optimization that make it possible to apply various adaptation approaches in the process of realizing the random search.
0 references