Online Primal-Dual Algorithms with Configuration Linear Programs

Author Nguyễn Kim Thắng

Thumbnail PDF


  • Filesize: 0.53 MB
  • 16 pages

Document Identifiers

Author Details

Nguyễn Kim Thắng
  • IBISC, Univ Evry, University Paris Saclay, France

Cite AsGet BibTex

Nguyễn Kim Thắng. Online Primal-Dual Algorithms with Configuration Linear Programs. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 45:1-45:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


In this paper, we present primal-dual algorithms for online problems with non-convex objectives. Problems with convex objectives have been extensively studied in recent years where the analyses rely crucially on the convexity and the Fenchel duality. However, problems with non-convex objectives resist against current approaches and non-convexity represents a strong barrier in optimization in general and in the design of online algorithms in particular. In our approach, we consider configuration linear programs with the multilinear extension of the objectives. We follow the multiplicative weight update framework in which a novel point is that the primal update is defined based on the gradient of the multilinear extension. We introduce new notions, namely (local) smoothness, in order to characterize the competitive ratios of our algorithms. The approach leads to competitive algorithms for several problems with convex/non-convex objectives.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
  • Configuration Linear Programs
  • Primal-Dual
  • Smoothness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. S. Anand, Naveen Garg, and Amit Kumar. Resource augmentation for weighted flow-time explained by dual fitting. In Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms, pages 1228-1241, 2012. Google Scholar
  2. Yossi Azar, Niv Buchbinder, TH Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Seffi Naor, and Debmalya Panigrahi. Online algorithms for covering and packing problems with convex objectives. In Proc. Symposium on Foundations of Computer Science (FOCS), 2016. Google Scholar
  3. Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, and Debmalya Panigrahi. Speed scaling in the non-clairvoyant model. In Proc. 27th ACM on Symposium on Parallelism in Algorithms and Architectures, pages 133-142, 2015. Google Scholar
  4. Avrim Blum, Anupam Gupta, Yishay Mansour, and Ankit Sharma. Welfare and profit maximization with production costs. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 77-86. IEEE, 2011. Google Scholar
  5. Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. Google Scholar
  6. Niv Buchbinder, Moran Feldman, and Roy Schwartz. Online submodular maximization with preemption. In Proc. 26th Symposium on Discrete Algorithms, pages 1202-1216, 2015. Google Scholar
  7. Niv Buchbinder and Joseph Naor. The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science, 3(2-3):93-263, 2009. Google Scholar
  8. Niv Buchbinder, Joseph Seffi Naor, R Ravi, and Mohit Singh. Approximation algorithms for online weighted rank function maximization under matroid constraints. In International Colloquium on Automata, Languages, and Programming, pages 145-156, 2012. Google Scholar
  9. Nikhil R. Devanur and Zhiyi Huang. Primal dual gives almost optimal energy efficient online algorithms. In Proc. 25th ACM-SIAM Symposium on Discrete Algorithms, 2014. Google Scholar
  10. Nikhil R. Devanur and Kamal Jain. Online matching with concave returns. In Proc. 44th ACM Symposium on Theory of Computing, pages 137-144, 2012. Google Scholar
  11. Moran Feldman, Joseph Naor, and Roy Schwartz. A unified continuous greedy algorithm for submodular maximization. In Symposium on Foundations of Computer Science (FOCS), pages 570-579, 2011. Google Scholar
  12. Moran Feldman, Ola Svensson, and Rico Zenklusen. Online contention resolution schemes. In Proc. 27th Symposium on Discrete Algorithms, pages 1014-1033, 2016. Google Scholar
  13. Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs. Online primal-dual for non-linear optimization with applications to speed scaling. In Proc. 10th Workshop on Approximation and Online Algorithms, pages 173-186, 2012. Google Scholar
  14. Zhiyi Huang and Anthony Kim. Welfare maximization with production costs: a primal dual approach. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 59-72. SIAM, 2015. Google Scholar
  15. Sascha Hunold. One step toward bridging the gap between theory and practice in moldable task scheduling with precedence constraints. Concurrency and Computation: Practice and Experience, 27(4):1010-1026, 2015. Google Scholar
  16. Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, and Kirk Pruhs. Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors. In Proc. 55th IEEE Symposium on Foundations of Computer Science, 2014. Google Scholar
  17. Andreas Krause and Daniel Golovin. Submodular function maximization. In Tractability: Practical Approaches to Hard Problems, pages 71-104. Cambridge University Press, 2014. Google Scholar
  18. Konstantin Makarychev and Maxim Sviridenko. Solving optimization problems with diseconomies of scale via decoupling. In Proc. 55th Symposium on Foundations of Computer Science, pages 571-580, 2014. Google Scholar
  19. Ishai Menache and Mohit Singh. Online caching with convex costs. In Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, pages 46-54. ACM, 2015. Google Scholar
  20. Viswanath Nagarajan and Xiangkun Shen. Online covering with sum of 𝓁_q-norm objectives. In Proc. 44th Colloquium on Automata, Languages and Programming (ICALP), 2017. Google Scholar
  21. Kim Thang Nguyen. Lagrangian duality in online scheduling with resource augmentation and speed scaling. In Proc. 21st European Symposium on Algorithms, pages 755-766, 2013. Google Scholar
  22. Tim Roughgarden. Intrinsic robustness of the price of anarchy. Journal of the ACM, 62(5):32, 2015. Google Scholar
  23. Jan Vondrák. Polyhedral techniques in combinatorial optimization. Lecture notes, November 18 2010. Google Scholar