ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2111.07707
  4. Cited By
Simultaneously Achieving Sublinear Regret and Constraint Violations for
  Online Convex Optimization with Time-varying Constraints

Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints

15 November 2021
Qingsong Liu
Wenfei Wu
Longbo Huang
Zhixuan Fang
ArXivPDFHTML

Papers citing "Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints"

6 / 6 papers shown
Title
On Distributed Online Convex Optimization with Sublinear Dynamic Regret
  and Fit
On Distributed Online Convex Optimization with Sublinear Dynamic Regret and Fit
Pranay Sharma
Prashant Khanduri
Lixin Shen
Donald J. Bucci
P. Varshney
39
18
0
09 Jan 2020
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
172
1,929
0
07 Sep 2019
Adaptive Online Learning in Dynamic Environments
Adaptive Online Learning in Dynamic Environments
Lijun Zhang
Shiyin Lu
Zhi Zhou
64
185
0
25 Oct 2018
Online Convex Optimization with Stochastic Constraints
Online Convex Optimization with Stochastic Constraints
Hao Yu
M. Neely
Xiaohan Wei
65
223
0
12 Aug 2017
Bandit Convex Optimization for Scalable and Dynamic IoT Management
Bandit Convex Optimization for Scalable and Dynamic IoT Management
Tianyi Chen
G. Giannakis
78
131
0
27 Jul 2017
An Online Convex Optimization Approach to Dynamic Network Resource
  Allocation
An Online Convex Optimization Approach to Dynamic Network Resource Allocation
Tianyi Chen
Qing Ling
G. Giannakis
394
216
0
14 Jan 2017
1