An Online Convex Optimization Approach to Proactive Network Resource Allocation
From MaRDI portal
Publication:4621962
DOI10.1109/TSP.2017.2750109zbMath1414.90076arXiv1701.03974OpenAlexW2951825612MaRDI QIDQ4621962
Tianyi Chen, Qing Ling, Georgios B. Giannakis
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.03974
Convex programming (90C25) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (9)
Predictive online convex optimization ⋮ Decentralized online convex optimization based on signs of relative states ⋮ Dynamic online convex optimization with long-term constraints via virtual queue ⋮ Distributed online bandit linear regressions with differential privacy ⋮ Online bandit convex optimisation with stochastic constraints via two-point feedback ⋮ Decentralized online convex optimization with compressed communications ⋮ No-regret learning for repeated non-cooperative games with lossy bandits ⋮ DIMIX: Diminishing Mixing for Sloppy Agents ⋮ Event-triggered distributed online convex optimization with delayed bandit feedback
This page was built for publication: An Online Convex Optimization Approach to Proactive Network Resource Allocation
