Pages that link to "Item:Q1016349"
From MaRDI portal
The following pages link to How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths (Q1016349):
Displaying 4 items.
- Change-point monitoring for online stochastic approximations (Q608474) (← links)
- Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies (Q2276105) (← links)
- Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents (Q2334631) (← links)
- (Q4999096) (← links)