A Saddle Point Algorithm for Networked Online Convex Optimization
From MaRDI portal
Cited in
(16)- A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs
- A distributed conjugate gradient online learning method over networks
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Online learning over a decentralized network through ADMM
- Decentralized online convex optimization based on signs of relative states
- Online distributed detection of sensor networks with delayed information
- Dynamic online convex optimization with long-term constraints via virtual queue
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Decentralized online convex optimization with compressed communications
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Distributed constrained online convex optimization with adaptive quantization
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
This page was built for publication: A Saddle Point Algorithm for Networked Online Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580831)
