Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints-Reference-Cited by-同舟云学术

Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints

Published:2021-12 Issue: Volume:152 Page:102240
ISSN:0166-5316
Container-title:Performance Evaluation
language:en
Short-container-title:Performance Evaluation

Author:

Liu Qingsong,Wu Wenfei,Huang Longbo,Fang Zhixuan

Funder

Ministry of Science and Technology of the People's Republic of China

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Hardware and Architecture,Modelling and Simulation,Software

Reference32 articles.

1. Online convex optimization with stochastic constraints;Yu,2017

2. Introduction to online convex optimization;Hazan,2019

3. An online convex optimization approach to proactive network resource allocation;Chen;IEEE Trans. Signal Process.,2017

4. A low complexity algorithm with O(T) regret and O(1) constraint violations for online convex optimization with long term constraints;Yu;J. Mach. Learn. Res.,2020

5. Beyond O(T) regret for constrained online optimization: Gradual variations and mirror prox;Qiu,2020

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning-based Scheduling for Information Gathering with QoS Constraints;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

2. Online Allocation with Replenishable Budgets: Worst Case and Beyond;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-02-16

3. Regret analysis of an online majorized semi-proximal ADMM for online composite optimization;Journal of Global Optimization;2024-02-15

4. Online convex optimization with switching cost and delayed gradients;Performance Evaluation;2023-11

5. Lazy Lagrangians for Optimistic Learning With Budget Constraints;IEEE/ACM Transactions on Networking;2023-10