Incremental Stochastic Subgradient Algorithms for Convex Optimization

From MaRDI portal
Publication:3563901

DOI10.1137/080726380zbMath1231.90312arXiv0806.1092OpenAlexW1973754217MaRDI QIDQ3563901

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

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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



Related Items

A new class of distributed optimization algorithms: application to regression of distributed data, Network Synchronization with Convexity, Consensus in opinion dynamics as a repeated game, Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds, Stochastic mirror descent method for distributed multi-agent optimization, A new Zeno-free event-triggered scheme for robust distributed optimal coordination, Incremental gradient-free method for nonsmooth distributed optimization, Strong consistency of random gradient‐free algorithms for distributed optimization, Randomized optimal consensus of multi-agent systems, An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization, Distributed stochastic subgradient projection algorithms for convex 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, Multi-cluster distributed optimization via random sleep strategy, Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Hierarchical constrained consensus algorithm over multi-cluster networks, Distributed multi-agent optimization subject to nonidentical constraints and communication delays, Convergence of random sleep algorithms for optimal consensus, On stochastic gradient and subgradient methods with adaptive steplength sequences, Distributed multi-agent optimization with state-dependent communication, Random algorithms for convex minimization problems, Incremental proximal methods for large scale convex optimization, Two stochastic optimization algorithms for convex optimization with fixed point constraints, Recent advances in optimization and game theoretic control for networked systems, Generalised gossip-based subgradient method for distributed optimisation, String-averaging incremental stochastic subgradient algorithms, Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate, An incremental subgradient method on Riemannian manifolds, Projected subgradient minimization versus superiorization, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, String-averaging projected subgradient methods for constrained minimization, A new algorithm for distributed control problem with shortest-distance constraints, 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, Markov chain block coordinate descent, Path-based incremental target level algorithm on Riemannian manifolds, Continuous-time distributed optimization with strictly pseudoconvex objective functions, A multi-scale method for distributed convex optimization with constraints, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes, The incremental subgradient methods on distributed estimations in-network, Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm