Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift

DOI10.1016/0167-8191(95)00005-9MaRDI QIDQ672599zbMATH OpenOpenAlexFDO

Authors Bassem F. Beidas, George P. Papavassilopoulos

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(95)00005-9

zbMATH Keywords

Convergence analysisAsynchronous iterationMultiprocessor environmentOptimization problemStochastic communication delay

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Asymptotic behavior of asynchronous stochastic approximation
• A distributed flexible delay-tolerant proximal gradient algorithm
• Asymptotic agreement and convergence of asynchronous stochastic algorithms
• Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks

Cited in

(5)

• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Asynchronous Max-Consensus Protocol With Time Delays: Convergence Results and Applications
• Stochastic stability in Max-Product and Max-Plus systems with Markovian jumps
• Asynchronous optimization over weakly coupled renewal systems
• Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting

This page was built for publication: Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift

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