Distributed stochastic subgradient projection algorithms for convex optimization
From MaRDI portal
Publication:620442
DOI10.1007/S10957-010-9737-7zbMATH Open1254.90171arXiv0811.2595OpenAlexW2066332749MaRDI QIDQ620442FDOQ620442
Authors: S. Sundhar Ram, Venugopal V. Veeravalli, Angelia Nedić 
Publication date: 19 January 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Abstract: We consider a distributed multi-agent network system where the goal is to minimize a sum of convex objective functions of the agents subject to a common convex constraint set. Each agent maintains an iterate sequence and communicates the iterates to its neighbors. Then, each agent combines weighted averages of the received iterates with its own iterate, and adjusts the iterate by using subgradient information (known with stochastic errors) of its own function and by projecting onto the constraint set. The goal of this paper is to explore the effects of stochastic subgradient errors on the convergence of the algorithm. We first consider the behavior of the algorithm in mean, and then the convergence with probability 1 and in mean square. We consider general stochastic errors that have uniformly bounded second moments and obtain bounds on the limiting performance of the algorithm in mean for diminishing and non-diminishing stepsizes. When the means of the errors diminish, we prove that there is mean consensus between the agents and mean convergence to the optimum function value for diminishing stepsizes. When the mean errors diminish sufficiently fast, we strengthen the results to consensus and convergence of the iterates to an optimal solution with probability 1 and in mean square.
Full work available at URL: https://arxiv.org/abs/0811.2595
Recommendations
- Stochastic mirror descent method for distributed multi-agent optimization
- Incremental stochastic subgradient algorithms for convex optimization
- Inexact dual averaging method for distributed multi-agent optimization
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
Convex programming (90C25) Stochastic programming (90C15) Stochastic network models in operations research (90B15)
Cites Work
- Convergence rate of incremental subgradient algorithms
- Title not available (Why is that?)
- Convex Analysis
- Title not available (Why is that?)
- Subgradient methods for saddle-point problems
- Title not available (Why is that?)
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Handbook of applied optimization
- Gradient Convergence in Gradient methods with Errors
- A Convergent Incremental Gradient Method with a Constant Step Size
- Title not available (Why is that?)
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Incremental subgradient methods for nondifferentiable optimization
- Cooperative distributed multi-agent optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed average consensus with least-mean-square deviation
- stochastic quasigradient methods and their application to system optimization†
- Convexity and characterization of optimal policies in a dynamic routing problem
- Error stability properties of generalized gradient-type algorithms
- Convergence speed in distributed consensus and averaging
- Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise
- Incremental stochastic subgradient algorithms for convex optimization
Cited In (only showing first 100 items - show all)
- Fully distributed algorithms for convex optimization problems
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- Distributed resource allocation over random networks based on stochastic approximation
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Asynchronous gossip-based gradient-free method for multiagent optimization
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Communication-efficient algorithms for decentralized and stochastic optimization
- Distributed stochastic nonsmooth nonconvex optimization
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Newton-like method with diagonal correction for distributed optimization
- Linear time average consensus and distributed optimization on fixed graphs
- Communication-computation tradeoff in distributed consensus optimization for MPC-based coordinated control under wireless communications
- Stopping rules for optimization algorithms based on stochastic approximation
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Asynchronous algorithms for computing equilibrium prices in a capital asset pricing model
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Distributed stochastic gradient tracking methods
- Distributed multi-agent optimization with state-dependent communication
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks
- Multiuser optimization: distributed algorithms and error analysis
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Distributed multi-task classification: a decentralized online learning approach
- On the linear convergence of two decentralized algorithms
- Incremental proximal methods for large scale convex optimization
- Gradient-free method for nonsmooth distributed optimization
- A decentralized multi-objective optimization algorithm
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Inexact dual averaging method for distributed multi-agent optimization
- Primal-dual algorithm for distributed constrained optimization
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
- Stochastic mirror descent method for distributed multi-agent optimization
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- On the convergence of decentralized gradient descent
- Incremental stochastic subgradient algorithms for convex optimization
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
- Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Revisiting EXTRA for Smooth Distributed Optimization
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Distributed Stochastic Optimization via Matrix Exponential Learning
- Distributed asynchronous incremental subgradient methods
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Distributed algorithms for aggregative games on graphs
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Distributed constrained optimization via continuous-time mirror design
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients
- A new class of distributed optimization algorithms: application to regression of distributed data
- Distributed mean reversion online portfolio strategy with stock network
- A Distributed Boyle--Dykstra--Han Scheme
- Graph-dependent implicit regularisation for distributed stochastic subgradient descent
- An accelerated exact distributed first-order algorithm for optimization over directed networks
- Gradient-free algorithms for distributed online convex optimization
- Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm
- Distributed line search for multiagent convex optimization
- Distributed Bregman-distance algorithms for min-max optimization
- String-averaging incremental stochastic subgradient algorithms
- Distributed heterogeneous multi-agent optimization with stochastic sub-gradient
- Stochastic mirror descent for convex optimization with consensus constraints
- Decentralized nonconvex optimization with guaranteed privacy and accuracy
- Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
- Distributed stochastic optimization algorithm with non-consistent constraints in time-varying unbalanced networks
- Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Strong consistency of random gradient-free algorithms for distributed optimization
- Asymptotic properties of primal-dual algorithm for distributed stochastic optimization over random networks with imperfect communications
- Distributed stochastic approximation with local projections
- An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
- A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes
- Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation
- Subgradient averaging for multi-agent optimisation with different constraint sets
- Distributed projection‐free algorithm for constrained aggregative optimization
- A collective neurodynamic penalty approach to nonconvex distributed constrained optimization
- A stochastic averaging gradient algorithm with multi‐step communication for distributed optimization
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
- Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks
- A dual approach for optimal algorithms in distributed optimization over networks
- Distributed constrained stochastic optimal consensus
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
- Fast decentralized nonconvex finite-sum optimization with recursive variance reduction
- Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- Noise-to-state exponentially stable distributed convex optimization on weight-balanced digraphs
- Variance-reduced reshuffling gradient descent for nonconvex optimization: centralized and distributed algorithms
- Fully Distributed Algorithms for Convex Optimization Problems
- Primal-dual \(\varepsilon\)-subgradient method for distributed optimization
This page was built for publication: Distributed stochastic subgradient projection algorithms for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620442)
