How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths (Q1016349)
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: How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths |
scientific article; zbMATH DE number 5550705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths |
scientific article; zbMATH DE number 5550705 |
Statements
How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths (English)
0 references
5 May 2009
0 references
0 references
0 references
0 references
0 references
0 references
