Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

119

APPROX
2015
Springer

29views Algorithms» more APPROX 2015»

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs

9 years 10 months ago

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs

Download www.win.tue.nl

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw

Real-time Traffic

Algorithms | APPROX 2015 |

claim paper

Related Content

» Online Convex Programming and regularization in adaptive control

» Online optimal timing control of switched systems

» Logarithmic Regret Algorithms for Online Convex Optimization

» Online convex optimization in the bandit setting gradient descent without a gradient

» Online Convex Programming and Generalized Infinitesimal Gradient Ascent

» A Robust PTAS for Machine Covering and Packing

» Online Tree Node Assignment with Resource Augmentation

» Playing games with approximation algorithms

» Nearly Tight Bounds for the ContinuumArmed Bandit Problem

» Online Function Tracking with Generalized Penalties

Post Info
More Details (n/a)

Added	16 Apr 2016
Updated	16 Apr 2016
Type	Journal
Year	2015
Where	APPROX
Authors	Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein

Comments (0)