Incremental stochastic subgradient algorithms for convex optimization
From MaRDI portal
Abstract: In this paper we study the effect of stochastic errors on two constrained incremental sub-gradient algorithms. We view the incremental sub-gradient algorithms as decentralized network optimization algorithms as applied to minimize a sum of functions, when each component function is known only to a particular agent of a distributed network. We first study the standard cyclic incremental sub-gradient algorithm in which the agents form a ring structure and pass the iterate in a cycle. We consider the method with stochastic errors in the sub-gradient evaluations and provide sufficient conditions on the moments of the stochastic errors that guarantee almost sure convergence when a diminishing step-size is used. We also obtain almost sure bounds on the algorithm's performance when a constant step-size is used. We then consider
am{the} Markov randomized incremental subgradient method, which is a non-cyclic version of the incremental algorithm where the sequence of computing agents is modeled as a time non-homogeneous Markov chain. Such a model is appropriate for mobile networks, as the network topology changes across time in these networks. We establish the convergence results and error bounds for the Markov randomized method in the presence of stochastic errors for diminishing and constant step-sizes, respectively.
Recommendations
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Distributed stochastic subgradient projection algorithms for convex optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- The effect of deterministic noise in subgradient methods
- Convergence rate of incremental subgradient algorithms
Cited in
(55)- Consensus in opinion dynamics as a repeated game
- Stochastic mirror descent method for distributed multi-agent optimization
- An incremental subgradient method on Riemannian manifolds
- A new algorithm for distributed control problem with shortest-distance constraints
- Randomized optimal consensus of multi-agent systems
- The effect of deterministic noise in subgradient methods
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- A multi-scale method for distributed convex optimization with constraints
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Hierarchical constrained consensus algorithm over multi-cluster networks
- Projected subgradient minimization versus superiorization
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Communication-efficient algorithms for decentralized and stochastic optimization
- Markov chain block coordinate descent
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- The incremental subgradient methods on distributed estimations in-network
- Incremental gradient-free method for nonsmooth distributed optimization
- Multi-cluster distributed optimization via random sleep strategy
- Convergence of random sleep algorithms for optimal consensus
- A new Zeno-free event-triggered scheme for robust distributed optimal coordination
- Incremental subgradient methods for nondifferentiable optimization
- A new class of distributed optimization algorithms: application to regression of distributed data
- Network synchronization with convexity
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- String-averaging incremental stochastic subgradient algorithms
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- Recent advances in optimization and game theoretic control for networked systems
- Path-based incremental target level algorithm on Riemannian manifolds
- Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm
- Strong consistency of random gradient-free algorithms for distributed optimization
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- Generalised gossip-based subgradient method for distributed optimisation
- scientific article; zbMATH DE number 5221408 (Why is no real title available?)
- String-averaging projected subgradient methods for constrained minimization
- An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
- Distributed cooperative optimization for multiple heterogeneous Euler-Lagrangian systems under global equality and inequality constraints
- Finite-time convergence rates of distributed local stochastic approximation
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- A Markovian Incremental Stochastic Subgradient Algorithm
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed multi-agent optimization with state-dependent communication
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Accelerating level-value adjustment for the Polyak stepsize
- Stochastic-constrained stochastic optimization with Markovian data
- Exponential convergence rate of distributed optimisation for multi-agent systems with constraints set over a directed graph
- Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
This page was built for publication: Incremental stochastic subgradient algorithms for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563901)
