Abstract
This work presents a comprehensive survey of the development of pseudogradient stochastic approximation algorithms with randomized input disturbance, considers the problems of their applicability in optimization problems with linear constraints, and discusses new possibilities to use them for multiagent control for load balancing of nodes in computational networks. Justifications of the algorithms' correctness and their optimal convergence rate are based on the foundational works of B.T. Polyak.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.