Distributed stochastic subgradient projection algorithms for convex optimization

DOI10.1007/s10957-010-9737-7zbMath1254.90171arXiv0811.2595OpenAlexW2066332749MaRDI QIDQ620442

Venugopal V. Veeravalli, S. Sundhar Ram, Angelia Nedić

Publication date: 19 January 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2595

zbMATH Keywords

Subgradient methods Stochastic approximation Distributed algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Related Items

A new class of distributed optimization algorithms: application to regression of distributed data, Stopping rules for optimization algorithms based on stochastic approximation, Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent, Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions, Dual averaging with adaptive random projection for solving evolving distributed optimization problems, Distributed multi-task classification: a decentralized online learning approach, Optimal distributed stochastic mirror descent for strongly convex optimization, Distributed resource allocation over random networks based on stochastic approximation, Primal-dual algorithm for distributed constrained optimization, Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization, Distributed Stochastic Approximation with Local Projections, Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications, Stochastic mirror descent method for distributed multi-agent optimization, Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation, Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs, Strong consistency of random gradient‐free algorithms for distributed optimization, Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique, An accelerated exact distributed first-order algorithm for optimization over directed networks, A stochastic averaging gradient algorithm with multi‐step communication for distributed optimization, A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems, Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems, An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization, An asynchronous subgradient-proximal method for solving additive convex optimization problems, Decentralized nonconvex optimization with guaranteed privacy and accuracy, A Distributed Boyle--Dykstra--Han Scheme, Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks, Linear Time Average Consensus and Distributed Optimization on Fixed Graphs, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Distributed projection‐free algorithm for constrained aggregative optimization, A collective neurodynamic penalty approach to nonconvex distributed constrained optimization, Event-triggered zero-gradient-sum distributed consensus optimization over directed networks, Distributed multi-agent optimization subject to nonidentical constraints and communication delays, Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization, On stochastic gradient and subgradient methods with adaptive steplength sequences, Incremental proximal methods for large scale convex optimization, Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm, Distributed constrained optimization via continuous-time mirror design, Distributed optimization with closed convex set for multi-agent networks over directed graphs, Inexact dual averaging method for distributed multi-agent optimization, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Asynchronous gossip-based gradient-free method for multiagent optimization, Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme, String-averaging incremental stochastic subgradient algorithms, Revisiting EXTRA for Smooth Distributed Optimization, Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs, Distributed optimization over directed graphs with row stochasticity and constraint regularity, Distributed consensus-based multi-agent convex optimization via gradient tracking technique, Distributed convex optimization with coupling constraints over time-varying directed graphs, Distributed primal–dual stochastic subgradient algorithms for multi‐agent optimization under inequality constraints, Communication-computation tradeoff in distributed consensus optimization for MPC-based coordinated control under wireless communications, Gradient-free method for nonsmooth distributed optimization, Distributed stochastic gradient tracking methods, A decentralized multi-objective optimization algorithm, On the linear convergence of two decentralized algorithms, Noise-to-State Exponentially Stable Distributed Convex Optimization on Weight-Balanced Digraphs, A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, Communication-efficient algorithms for decentralized and stochastic optimization, On the Convergence of Decentralized Gradient Descent, Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication, On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints, Distributed Algorithms for Aggregative Games on Graphs, Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks, An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs, A multi-scale method for distributed convex optimization with constraints, Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model, Computing over Unreliable Communication Networks, Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes, Convergence results of a nested decentralized gradient method for non-strongly convex problems, 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, Primal-dual stochastic distributed algorithm for constrained convex optimization, Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm, On arbitrary compression for decentralized consensus and stochastic optimization over directed networks, EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization, A dual approach for optimal algorithms in distributed optimization over networks, Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms, Distributed stochastic nonsmooth nonconvex optimization, Distributed Bregman-Distance Algorithms for Min-Max Optimization, Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction, Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes, Newton-like Method with Diagonal Correction for Distributed Optimization

Cites Work