How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths

From MaRDI portal
Publication:1016349

DOI10.1007/s10107-007-0145-1zbMath1161.62047OpenAlexW1975973957MaRDI QIDQ1016349

C. Ion, G. George Yin, Vikram Krishnamurthy

Publication date: 5 May 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0145-1



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (3)



Cites Work


This page was built for publication: How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths