Online Convex Optimization With Time-Varying Constraints and Bandit Feedback

DOI10.1109/TAC.2018.2884653zbMath1482.90126OpenAlexW2902440224MaRDI QIDQ5223782

K. J. Ray Liu, Xuanyu Cao

Publication date: 18 July 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2018.2884653

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15)

Related Items (7)

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 ⋮ 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

This page was built for publication: Online Convex Optimization With Time-Varying Constraints and Bandit Feedback