Online Convex Optimization with Time-Varying Constraints

Online convex programming and generalized infinitesimal gradient ascent

M. Zinkevich · 2003

Earlier work this paper cites.

Convex Analysis and Optimization

Original

D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar · 2003

Earlier work this paper cites.

Introductory Lectures on Convex Optimization: A Basic Course

Y. Nesterov · 2004

Earlier work this paper cites.

Logarithmic regret algorithms for online convex optimization

E. Hazan, A. Agarwal, and S. Kale · 2007

Earlier work this paper cites.

Online learning with sample path constraints

S. Mannor, J. N. Tsitsiklis, and J. Y. Yu · 2009

Earlier work this paper cites.

Subgradient methods for saddle-point problems

Angelia Nedić and Asuman Ozdaglar · 2009

Cited alongside, same era.

Online learning and online convex optimization

Shai Shalev-Shwartz · 2011

Cited alongside, same era.

Trading regret for efficiency: online convex optimization with long term constraints

Mehrdad Mahdavi, Rong Jin, and Tianbao Yang · 2012

Cited alongside, same era.

Stochastic convex optimization with multiple objectives

M. Mahdavi, T. Yang, and R. Jin · 2013

Cited alongside, same era.

Adaptive algorithms for online convex optimization with long-term constraints

Rodolphe Jenatton, Jim Huang, and Cedric Archambeau · 2016

Later among the works it cites.

A low complexity algorithm with O ⁡ ( T ) {O}(\sqrt{T}) regret and finite constraint violations for online convex optimization with long term constraints

Original

H. Yu and M. J. Neely · 2016

Later among the works it cites.

A low complexity algorithm with O ⁡ ( T ) {O}(\sqrt{T}) regret and finite constraint violations for online convex optimization with long term constraints

Original

H. Yu and M. J. Neely · 2016

Later among the works it cites.

A simple parallel algorithm with an O ⁡ ( 1 / t ) {O}(1/t) convergence rate for general convex programs

H. Yu and M. J. Neely · 2017

Closest in time.