Distributed online optimization with switching costs
From MaRDI portal
Cites work
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Distributed Finite-Time Average-Consensus With Limited Computational and Storage Capability
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed online optimization for heterogeneous linear multi-agent systems with coupled constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs
- Modeling and Design of Adaptive Video Streaming Control Systems
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Online learning and online convex optimization
- Online Optimization With Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
- Online Stochastic Optimization With Time-Varying Distributions
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- The Impact of Stealthy Attacks on Smart Grid Performance: Tradeoffs and Implications
- The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs
- Unified algorithms for online learning and competitive analysis
This page was built for publication: Distributed online optimization with switching costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7321129)