Adaptive online distributed optimization in dynamic environments
From MaRDI portal
Recommendations
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- A distributed conjugate gradient online learning method over networks
- Online learning over a decentralized network through ADMM
- Decentralized online convex optimization based on signs of relative states
- Distributed online bandit optimization under random quantization
Cites work
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems
- A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- Adaptive subgradient methods for online learning and stochastic optimization
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs
- DILAND
- DILAND: An Algorithm for Distributed Sensor Localization With Noisy Distance Measurements
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed Charging Control of Electric Vehicles Using Online Learning
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Subgradient Methods for Multi-Agent Optimization
- Ergodic Stochastic Optimization Algorithms for Wireless Communication and Networking
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fastest Mixing Markov Chain on a Graph
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Non-stationary stochastic optimization
- On the convergence of decentralized gradient descent
- Stochastic Event-Triggered Sensor Schedule for Remote State Estimation
- Tracking Dynamic Point Processes on Networks
Cited in
(19)- Distributed multi-task classification: a decentralized online learning approach
- Bounds for the tracking error of first-order online optimization methods
- Adaptive step size selection in distributed optimization with observation noise and unknown stochastic target variation
- Distributed online bandit optimization under random quantization
- A distributed conjugate gradient online learning method over networks
- Adaptive distributed optimization algorithms for Euler-Lagrange systems
- Online learning over a decentralized network through ADMM
- Decentralized online convex optimization based on signs of relative states
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Distributed Adaptive Optimization With Weight-Balancing
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- On the Value of Objective Function Adaptation in Online Optimisation
- Decentralized online convex optimization with compressed communications
- Dynamic regret of adaptive gradient methods for strongly convex problems
- Distributed online optimisation in unknown dynamic environment
- Online composite optimization with time-varying regularizers
- Distributed adaptive online learning for convex optimization with weight decay
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
This page was built for publication: Adaptive online distributed optimization in dynamic environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865329)
