3 papers
cs.LG2026
Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)
Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze
The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action , a convex l…
cs.LG2026
Convex Optimization with Nested Evolving Feasible Sets
Karthick Krishna M., Haricharan Balasundaram, Rahul Vaze
\emph{Convex Optimization with Nested Evolving Feasible Sets (CONES)} is considered where the objective function \(f\) remains fixed but the feasible region evolves over time as a…
cs.LG2026
Breaking the Cumulative Constraint Violation Barrier while Achieving Static Regret in Constrained Online Convex Optimization
Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze
The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action , a convex l…