Distributed Subgradient Methods for Convex Optimization Over Random Networks
From MaRDI portal
(Redirected from Publication:5347735)
Cited in
(52)- Distributed resource allocation over random networks based on stochastic approximation
- Stochastic mirror descent method for distributed multi-agent optimization
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed optimization of multiagent systems in directed networks with time-varying delay
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Distributed gradient tracking methods with finite data rates
- A multi-scale method for distributed convex optimization with constraints
- Convergence results of a nested decentralized gradient method for non-strongly convex problems
- Gradient-free distributed optimization with exact convergence
- Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes
- Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
- Distributed secure state estimation for cyber-physical systems under sensor attacks
- Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs
- Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks
- Random block coordinate descent methods for linearly constrained optimization over networks
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation
- A distributed methodology for approximate uniform global minimum sharing
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Distributed constrained optimal consensus of multi-agent systems
- Special issue on ``Distributed and networked control systems
- Distributed convex optimisation with event-triggered communication in networked systems
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Distributed algorithms for aggregative games on graphs
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Primal-dual algorithm for distributed constrained optimization
- Asymptotic properties of primal-dual algorithm for distributed stochastic optimization over random networks with imperfect communications
- Swarming for faster convergence in stochastic optimization
- Graph-dependent implicit regularisation for distributed stochastic subgradient descent
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- A flocking-based approach for distributed stochastic optimization
- Distributed Bregman-distance algorithms for min-max optimization
- Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays
- Distributed multi-step subgradient projection algorithm with adaptive event-triggering protocols: a framework of multiagent systems
- Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks
- Distributed Multiagent Convex Optimization Over Random Digraphs
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Distributed optimization over weight-balanced digraphs with event-triggered communication
- Opinion dynamics and learning in social networks
- Computing over unreliable communication networks
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
- A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles
- DIMIX: Diminishing Mixing for Sloppy Agents
- Distributed stochastic subgradient projection algorithms for convex optimization
- Decentralized stochastic subgradient projection optimization algorithms over random networks
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
- Accelerating level-value adjustment for the Polyak stepsize
- Distributed zero-gradient-sum optimisation algorithm with an edge-based adaptive event-triggered mechanism
- Performing linear convergence for distributed constrained optimisation over time-varying directed unbalanced networks
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks
This page was built for publication: Distributed Subgradient Methods for Convex Optimization Over Random Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347735)
