Gradient-free algorithms for distributed online convex optimization
From MaRDI portal
Recommendations
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Decentralized online convex optimization based on signs of relative states
Cites work
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Coordination and Geometric Optimization via Distributed Dynamical Systems
- Design and Stability of Load-Side Primary Frequency Control in Power Systems
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Online Optimization With Long-Term Constraints
- Distributed Sparse Linear Regression
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Efficient Sensor Management Policies for Distributed Target Tracking in Multihop Sensor Networks
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Graphical models, exponential families, and variational inference
- How to use expert advice
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Online learning and online convex optimization
- Prediction, Learning, and Games
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Stochastic mirror descent method for distributed multi-agent optimization
Cited in
(5)- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- Online convex optimization using coordinate descent algorithms
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Gradient-free distributed online optimization in networks
- Linear convergence of event-triggered distributed optimization with metric subregularity condition
This page was built for publication: Gradient-free algorithms for distributed online convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581072)
