A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
From MaRDI portal
Publication:3586129
DOI10.1137/08073038XzbMath1201.65100OpenAlexW2049659086MaRDI QIDQ3586129
Mikael Johansson, Maben Rabi, Björn 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
Related Items (48)
Distributed continuous-time approximate projection protocols for shortest distance optimization problems ⋮ Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings ⋮ Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Distributed Line Search for Multiagent Convex Optimization ⋮ Stochastic mirror descent method for distributed multi-agent optimization ⋮ Incremental gradient-free method for nonsmooth distributed optimization ⋮ Distributed optimal in-network resource allocation algorithm design via a control theoretic approach ⋮ Distributed strategies for generating weight-balanced and doubly stochastic digraphs ⋮ Strong consistency of random gradient‐free algorithms for distributed optimization ⋮ Randomized optimal consensus of multi-agent systems ⋮ Distributed time‐varying convex optimal consensus control for multi‐agent system with/without chattering restrain ⋮ Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication ⋮ Distributed time‐varying optimization control for multirobot systems with collision avoidance by hierarchical approach ⋮ A Unified Framework for Continuous-Time Unconstrained Distributed Optimization ⋮ A distributed finite‐time optimization algorithm for directed networks of continuous‐time agents ⋮ Convergence of random sleep algorithms for optimal consensus ⋮ A distributed fixed-time optimization algorithm for multi-agent systems ⋮ Incremental proximal methods for large scale convex optimization ⋮ Distributed subgradient method for multi-agent optimization with quantized communication ⋮ Recent advances in optimization and game theoretic control for networked systems ⋮ Accelerating the distributed Kaczmarz algorithm by strong over-relaxation ⋮ Network-decentralised optimisation and control: an explicit saturated solution ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate ⋮ A distributed hierarchical algorithm for multi-cluster constrained optimization ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization ⋮ Distributed convergence to Nash equilibria in two-network zero-sum games ⋮ Parallel alternating direction method of multipliers ⋮ A simple self-triggered sampler for perturbed nonlinear systems ⋮ Distributed optimization with information-constrained population dynamics ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Gradient-free method for nonsmooth distributed optimization ⋮ Measurement-based efficient resource allocation with demand-side adjustments ⋮ Distributed extremum-seeking control over networks of dynamically coupled unstable dynamic agents ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication ⋮ A distributed continuous-time modified Newton-Raphson algorithm ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ Distributed Algorithms for Aggregative Games on Graphs ⋮ Adaptive optimization with periodic dither signals ⋮ Projected subgradient based distributed convex optimization with transmission noises ⋮ Distributed coordination for nonsmooth convex optimization via saddle-point dynamics ⋮ Distributed optimization for uncertain nonlinear interconnected multi-agent systems ⋮ The incremental subgradient methods on distributed estimations in-network ⋮ A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations ⋮ Distributed Bregman-Distance Algorithms for Min-Max Optimization
This page was built for publication: A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
