Gradient-free algorithms based on weight-balancing for online distributed optimisation
From MaRDI portal
Cites work
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Design and Stability of Load-Side Primary Frequency Control in Power Systems
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed bandit online optimisation for energy management in smart grids
- Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
- Distributed convex optimisation with event-triggered communication in networked systems
- Distributed finite-time optimisation for multi-agent systems via event-triggered aperiodically intermittent communication
- Distributed online optimisation in unknown dynamic environment
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Online Optimization With Long-Term Constraints
- Distributed optimisation problem with communication delay and external disturbance
- Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
- Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Weight Balancing Over Digraphs
- Graphical models, exponential families, and variational inference
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
- Privacy-preserving distributed projected one-point bandit online optimization over directed graphs
- Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis
- Theory of probability and random processes.
This page was built for publication: Gradient-free algorithms based on weight-balancing for online distributed optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230743)