"How does a stochastic optimization/approximation algorithm adapt to a ..."

Gang George Yin, Cristina Ion, Vikram Krishnamurthy (2009)

> Home

Details and statistics

DOI: 10.1007/S10107-007-0145-1

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/YinIK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/YinIK09
Gang George Yin, Cristina Ion, Vikram Krishnamurthy:
How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths. Math. Program. 120(1): 67-99 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.