Optimal quasi-convex combinations for stochastic approximation algorithms with parallel observers

DOI10.1080/00207178908961364MaRDI QIDQ4735125zbMATH OpenOpenAlexWikidataFDO

Authors Yunmin Zhu, G. Yin

Publication date 1989

Full work available at URL https://doi.org/10.1080/00207178908961364

zbMATH Keywords

adaptive controldecentralized estimationdetectionMonte Carlo optimizationparallel observersRobbins-Monro (RM) SA proceduresstochastic approximation (SA) algorithms

Mathematics Subject Classification ID

Recommendations

• Stochastic approximation algorithms for parallel and distributed processing
• scientific article; zbMATH DE number 440437
• On robustness of the Robbins-Monro method for parallel processing
• On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
• Parallel and bootstrapped stochastic approximation

Cited in

(4)

• Joint robustness on noise and Lyapunov functions for parallel stochastic approximation algorithms
• On W.P.1 Convergence of A Parallel Stochastic Approximation Algorithm
• Stochastic approximation algorithms for parallel and distributed processing
• Parallel and bootstrapped stochastic approximation

This page was built for publication: Optimal quasi-convex combinations for stochastic approximation algorithms with parallel observers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735125)