Local search proximal algorithms as decision dynamics with costs to move (Q632228)
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: Local search proximal algorithms as decision dynamics with costs to move |
scientific article; zbMATH DE number 5865915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search proximal algorithms as decision dynamics with costs to move |
scientific article; zbMATH DE number 5865915 |
Statements
Local search proximal algorithms as decision dynamics with costs to move (English)
0 references
15 March 2011
0 references
costs-to-move
0 references
decision dynamics
0 references
exploration process
0 references
friction
0 references
inertia
0 references
local optimization
0 references
local search algorithms
0 references
proximal algorithms
0 references
worthwhile-to-move incremental process
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.6974104642868042
0 references
0.6864668726921082
0 references
0.6789761781692505
0 references
0.6662363409996033
0 references
