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

Advances in Neural Information Processing Systems

Volumn , Issue , 2016, Pages 3287-3295

  Eghbali, Reza ^a   Fazel, Maryam ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; COST FUNCTIONS; FUNCTIONS;

BIPARTITE MATCHINGS; COMPETITIVE RATIO; CONVEX OPTIMIZATION PROBLEMS; OBJECTIVE FUNCTIONS; ONLINE OPTIMIZATION; OPTIMIZATION PROBLEMS; PRIMAL DUAL ALGORITHMS; SMOOTHING FUNCTION;

OPTIMIZATION;

EID: 85010743821     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Jacob Abernethy, Elad Hazan, and Alexander Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In COLT, pages 263-274, 2008.
2. Shipra Agrawal and Nikhil R Devanur. Fast algorithms for online stochastic convex programming. arXiv preprint arXiv: 1410.7596, 2014.
3. Yossi Azar, Ilan Reuven Cohen, and Debmalya Panigrahi. Online covering with convex objectives and applications. arXiv preprint arXiv: 1412.3507, 2014.
4. Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, et al. Online packing and covering framework with convex objectives. arXiv preprint arXiv: 1412.8347, 2014.
5. Niv Buchbinder, Kamal Jain, and Joseph Seffi Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Algorithms-ESA 2007, pages 253-264. Springer, 2007.
6. Niv Buchbinder and Joseph Naor. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research, 34(2): 270-286, 2009.
7. TH Chan, Zhiyi Huang, and Ning Kang. Online convex covering and packing problems. arXiv preprint arXiv: 1502.01802, 2015.
8. Nikhil R Devanur and Kamal Jain. Online matching with concave returns. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 137-144. ACM, 2012.
9. Nikhil R Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A Wilkens. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In Proceedings of the 12th ACM conference on Electronic commerce, pages 29-38. ACM, 2011.
10. R. Eghbali, M. Fazel, and M. Mesbahi. Worst Case Competitive Analysis for Online Conic Optimization. In 55th IEEE conference on decision and control (CDC). IEEE, 2016.
11. Reza Eghbali, Jon Swenson, and Maryam Fazel. Exponentiated subgradient algorithm for online optimization under the random permutation model. arXiv preprint arXiv: 1410.7171, 2014.
12. Anupam Gupta and Marco Molinaro. How the experts algorithm can help solve lps online. arXiv preprint arXiv: 1407.5298, 2014.
13. Bala Kalyanasundaram and Kirk R Pruhs. An optimal deterministic algorithm for online b-matching. Theoretical Computer Science, 233(1): 319-325, 2000.
14. Richard M Karp, Umesh V Vazirani, and Vijay V Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 352-358. ACM, 1990.
15. Robert Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 630-631. Society for Industrial and Applied Mathematics, 2005.
16. Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. Journal of the ACM (JACM), 54(5): 22, 2007.
17. Yu Nesterov. Smooth minimization of non-smooth functions. Mathematical programming, 103(1): 127-152, 2005.
18. Yurii Nesterov. Primal-dual subgradient methods for convex problems. Mathematical programming, 120(1): 221-259, 2009.
19. Shai Shalev-Shwartz and Yoram Singer. Online learning: Theory, algorithms, and applications. 2007.
20. Shai Shalev-Shwartz and Yoram Singer. A primal-dual perspective of online learning algorithms. Machine Learning, 69(2-3): 115-142, 2007.