A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
From MaRDI portal
Publication:3586129
DOI10.1137/08073038XzbMATH Open1201.65100OpenAlexW2049659086MaRDI QIDQ3586129FDOQ3586129
Authors: Björn Johansson, Maben Rabi, Mikael Johansson 
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/08073038x
Recommendations
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental gradient-free method for nonsmooth distributed optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Convergence rate of incremental subgradient algorithms
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Distributed stochastic subgradient projection algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Distributed stochastic nonsmooth nonconvex optimization
- The incremental subgradient methods on distributed estimations in-network
Cited In (58)
- Output feedback distributed optimization algorithms of second-order Lipschitz nonlinear multi-agent systems
- Optimal gradient tracking for decentralized optimization
- Distributed finite-time optimisation algorithm for second-order multi-agent systems subject to mismatched disturbances
- On the convergence of broadcast incremental algorithms with applications
- A distributed finite‐time optimization algorithm for directed networks of continuous‐time agents
- Cooperative distributed extremum seeking control for coupled multiagent systems based on distributed identification-gradient tracking
- Output feedback distributed optimization algorithms of higher-order uncertain nonlinear multi-agent systems
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- A simple self-triggered sampler for perturbed nonlinear systems
- Network-decentralised optimisation and control: an explicit saturated solution
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Distributed time‐varying optimization control for multirobot systems with collision avoidance by hierarchical approach
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Distributed subgradient method for multi-agent optimization with quantized communication
- A Unified Framework for Continuous-Time Unconstrained Distributed Optimization
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Incremental proximal methods for large scale convex optimization
- Gradient-free method for nonsmooth distributed optimization
- Strong consistency of random gradient-free algorithms for distributed optimization
- The incremental subgradient methods on distributed estimations in-network
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
- Randomized optimal consensus of multi-agent systems
- Distributed time‐varying convex optimal consensus control for multi‐agent system with/without chattering restrain
- Stochastic mirror descent method for distributed multi-agent optimization
- Distributed extremum-seeking control over networks of dynamically coupled unstable dynamic agents
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent
- Incremental stochastic subgradient algorithms for convex optimization
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
- A distributed continuous-time modified Newton-Raphson algorithm
- A distributed fixed-time optimization algorithm for multi-agent systems
- Distributed optimization with information-constrained population dynamics
- Convergence of random sleep algorithms for optimal consensus
- Parallel alternating direction method of multipliers
- Distributed Line Search for Multiagent Convex Optimization
- Adaptive optimization with periodic dither signals
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Recent advances in optimization and game theoretic control for networked systems
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- Projected subgradient based distributed convex optimization with transmission noises
- Incremental gradient-free method for nonsmooth distributed optimization
- Distributed Bregman-Distance Algorithms for Min-Max Optimization
- Distributed optimization for uncertain nonlinear interconnected multi-agent systems
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- Distributed asynchronous incremental subgradient methods
- Measurement-based efficient resource allocation with demand-side adjustments
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints
- Distributed algorithms for aggregative games on graphs
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- Path-based incremental target level algorithm on Riemannian manifolds
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
This page was built for publication: A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586129)
