Gradient-free algorithms for distributed online convex optimization
From MaRDI portal
Publication:6581072
DOI10.1002/ASJC.2996MaRDI QIDQ6581072
Daoyi Dong, Wen-Xiao Zhao, Yuhang Liu
Publication date: 30 July 2024
Published in: Asian Journal of Control (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Stochastic mirror descent method for distributed multi-agent optimization
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Design and Stability of Load-Side Primary Frequency Control in Power Systems
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Online Learning and Online Convex Optimization
- Coordination and Geometric Optimization via Distributed Dynamical Systems
- Graphical Models, Exponential Families, and Variational Inference
- How to use expert advice
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Efficient Sensor Management Policies for Distributed Target Tracking in Multihop Sensor Networks
- Distributed Sparse Linear Regression
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization With Long-Term Constraints
- Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Prediction, Learning, and Games
- Stochastic Estimation of the Maximum of a Regression Function
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)