Distributed asynchronous deterministic and stochastic gradient optimization algorithms
From MaRDI portal
Recommendations
- Distributed asynchronous incremental subgradient methods
- Asymptotic agreement and convergence of asynchronous stochastic algorithms
- Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift
- Asymptotic behavior of asynchronous stochastic approximation
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
Cited in
(only showing first 100 items - show all)- On the mathematics of emergence
- Consensus protocols for discrete-time multi-agent systems with time-varying delays
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
- Distributed supply chain management using ant colony optimization
- Asynchronous algorithms in non-cooperative games
- Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
- On robustness of the Robbins-Monro method for parallel processing
- Convergence analysis of asynchronous linear iterations with stochastic delays
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Modal consensus, synchronization and formation control with distributed endogenous internal models
- Consensus-based modeling using distributed feature construction with ILP
- Leader-following consensus of multi-agent systems with jointly connected topology using distributed adaptive protocols
- A cooperative optimization algorithm inspired by chaos-order transition
- Stochastic mirror descent method for distributed multi-agent optimization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- On multi-agent self-tuning consensus
- Maximizing the coverage of roadmap graph for optimal motion planning
- Consensus of multi-agent systems via hybrid impulsive protocols with time-delay
- Consensus rate regulation for general linear multi-agent systems under directed topology
- Making noise: emergent stochasticity in collective motion
- An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- On control of strong consensus for networked agents with noisy observations
- Cyclic stochastic approximation with disturbance on input in the parameter tracking problem based on a multiagent algorithm
- A new approach to average consensus problems with multiple time-delays and jointly-connected topologies
- Randomized optimal consensus of multi-agent systems
- The landscape of empirical risk for nonconvex losses
- Asynchronous iterative sub-structuring methods
- A decentralized strategy for generalized Nash equilibrium with linear coupling constraints
- Gradient-free method for nonsmooth distributed optimization
- Stochastic approximation on Riemannian manifolds
- Distributed stochastic gradient tracking methods
- A study on distributed optimization over large-scale networked systems
- Distributed linear regression by averaging
- Reaching a consensus via Krause mean processes in multi-agent systems: quadratic stochastic operators
- A sharp convergence rate for a model equation of the asynchronous stochastic gradient descent
- Asynchronous networked aggregative games
- Fully asynchronous policy evaluation in distributed reinforcement learning over networks
- Multi-agent control: a graph-theoretic perspective
- A multi-scale method for distributed convex optimization with constraints
- Surplus-based accelerated algorithms for distributed optimization over directed networks
- Triggered gradient tracking for asynchronous distributed optimization
- A resilient continuous-time consensus method using a switching topology
- Distributed optimization for uncertain Euler-Lagrange systems with local and relative measurements
- Delay-dependent consensus criteria for fractional-order Takagi-Sugeno fuzzy multi-agent systems with time delay
- Adaptive backstepping for distributed optimization
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- Nonlinear robustified stochastic consensus seeking
- Network flows that solve least squares for linear equations
- Asynchronous parallel algorithms for nonconvex optimization
- Asynchronous level bundle methods
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
- Self-tuning average consensus in complex networks
- Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies
- Dynamics of opinions with social biases
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models
- Communication-efficient algorithms for decentralized and stochastic optimization
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Dynamic coupling design for nonlinear output agreement and time-varying flow control
- Agreeing in networks: unmatched disturbances, algebraic constraints and optimality
- Consensus based overlapping decentralized estimation with missing observations and communication faults
- On backward product of stochastic matrices
- Approximate consensus in the dynamic stochastic network with incomplete information and measurement delays
- Behaviors of networks with antagonistic interactions and switching topologies
- Optimizing the convergence rate of the quantum consensus: a discrete-time model
- Distributed semi-supervised support vector machines
- Traversing the Schrödinger bridge strait: Robert Fortet's marvelous proof redux
- On the convergence of asynchronous parallel iteration with unbounded delays
- Convergence and stability analysis for iterative dynamics with application to compartmental networks: a trajectory distance based Lyapunov approach
- Convergence of random sleep algorithms for optimal consensus
- Consensus of high-order multi-agent systems with switching topologies
- Notes on averaging over acyclic digraphs and discrete coverage control
- Synchronizing linear systems via partial-state coupling
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Multi-agent flocking under topological interactions
- Convergence of a class of multi-agent systems in probabilistic framework
- Flocking in noisy environments
- Distributed optimization for a class of uncertain MIMO nonlinear multi-agent systems with arbitrary relative degree
- Leader-following multiple unmanned underwater vehicles consensus control under the fixed and switching topologies with unmeasurable disturbances
- A new Zeno-free event-triggered scheme for robust distributed optimal coordination
- Subgradient averaging for multi-agent optimisation with different constraint sets
- On the convergence analysis of asynchronous SGD for solving consistent linear systems
- On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization
- Distributed asynchronous incremental subgradient methods
- Noise-to-state exponentially stable distributed convex optimization on weight-balanced digraphs
- Nonlinear gossip
- On the convergence of decentralized gradient descent
- On symmetric continuum opinion dynamics
- Stopping rules for optimization algorithms based on stochastic approximation
- Deployment algorithms for a power-constrained mobile sensor network
- Multi-vehicle coordination for double-integrator dynamics under fixed undirected/directed interaction in a sampled-data setting
- Wolfowitz's theorem and consensus algorithms in Hadamard spaces
- Multiagent systems with compasses
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- Results in cooperative control and implicit consensus
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
This page was built for publication: Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738944)
