# Designing smoothing functions for improved worst-case competitive ratio in online optimization

Reza EghbaliMaryam Fazel

Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns. We analyze the worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems that contains the previous examples as special cases defined on the positive orthant... (read more)

PDF Abstract