{"total":14,"rows":[{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"area":null},{"id":"2605.21107","title":"A Geometric Approach to Constrained Online Learning","created":"2026-05-20","cited_by_count":5,"area":null},{"id":"2605.07386","title":"Convex Optimization with Nested Evolving Feasible Sets","created":"2026-05-08","cited_by_count":4,"area":null},{"id":"2502.16744","title":"BAGEL: Adversarially Constrained Online Convex Optimization under Separation Oracle Access","created":"2025-02-23","cited_by_count":3,"area":null},{"id":"2603.20671","title":"Breaking the $O(\\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\\sqrt{T})$ Static Regret in Constrained Online Convex Optimization","created":"2026-03-21","cited_by_count":3,"area":null},{"id":"2509.11357","title":"Online Omniprediction with Long-Term Constraints","created":"2025-09-14","cited_by_count":2,"area":null},{"id":"2405.09296","title":"Tight Bounds for Online Convex Optimization with Adversarial Constraints","created":"2024-05-15","cited_by_count":1,"area":null},{"id":"2510.22579","title":"Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2510.07266","title":"Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2510.13560","title":"Multi-Objective $\\textit{min-max}$ Online Convex Optimization","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2607.10808","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2609.11207","title":"Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2610.03983","title":"$\\tilde{O}(\\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}