A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints

Resource Allocation Problems: Algorithmic Approaches

Toshihide Ibaraki and Naoki Katoh · 1988

Earlier work this paper cites.

Dynamic Power Allocation and Routing for Satellite and Wireless Networks with Time Varying Channels

Michael J. Neely · 2003

Earlier work this paper cites.

Online convex programming and generalized infinitesimal gradient ascent

Martin Zinkevich · 2003

Earlier work this paper cites.

Convex Optimization

Stephen Boyd and Lieven Vandenberghe · 2004

Earlier work this paper cites.

Prediction, Learning, and Games

Nicolò Cesa-Bianchi and Gábor Lugosi · 2006

Earlier work this paper cites.

A tutorial on geometric programming

Stephen Boyd, Seung-Jean Kim, Lieven Vandenberghe, and Arash Hassibi · 2007

Earlier work this paper cites.

Logarithmic regret algorithms for online convex optimization

Elad Hazan, Amit Agarwal, and Satyen Kale · 2007

Cited alongside, same era.

Bidding for representative allocations for display advertising

Arpita Ghosh, Preston McAfee, Kishore Papineni, and Sergei Vassilvitskii · 2009

Cited alongside, same era.

Stochastic network optimization with application to communication and queueing systems

Michael J. Neely · 2010

Cited alongside, same era.

Online display advertising: targeting and obtrusiveness

Avi Goldfarb and Catherine Tucker · 2011

Cited alongside, same era.

Online learning and online convex optimization

Shai Shalev-Shwartz · 2011

Cited alongside, same era.

Projection-free online learning

Elad Hazan and Satyen Kale · 2012

Later among the works it cites.

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

Mehrdad Mahdavi, Rong Jin, and Tianbao Yang · 2012

Later among the works it cites.

Adaptive algorithms for online convex optimization with long-term constraints

Rodolphe Jenatton, Jim Huang, and Cédric Archambeau · 2016

Closest in time.

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

Hao Yu and Michael J. Neely · 2017

Closest in time.

Online convex optimization with stochastic constraints

Hao Yu, Michael Neely, and Xiaohan Wei · 2017

Closest in time.