Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Primal-Dual Framework for Symmetric Cone Programming (2405.09157v1)

Published 15 May 2024 in math.OC, cs.CG, cs.DC, and cs.DS

Abstract: In this paper, we introduce a primal-dual algorithmic framework for solving Symmetric Cone Programs (SCPs), a versatile optimization model that unifies and extends Linear, Second-Order Cone (SOCP), and Semidefinite Programming (SDP). Our work generalizes the primal-dual framework for SDPs introduced by Arora and Kale, leveraging a recent extension of the Multiplicative Weights Update method (MWU) to symmetric cones. Going beyond existing works, our framework can handle SOCPs and mixed SCPs, exhibits nearly linear time complexity, and can be effectively parallelized. To illustrate the efficacy of our framework, we employ it to develop approximation algorithms for two geometric optimization problems: the Smallest Enclosing Sphere problem and the Support Vector Machine problem. Our theoretical analyses demonstrate that the two algorithms compute approximate solutions in nearly linear running time and with parallel depth scaling polylogarithmically with the input size. We compare our algorithms against CGAL as well as interior point solvers applied to these problems. Experiments show that our algorithms are highly efficient when implemented on a CPU and achieve substantial speedups when parallelized on a GPU, allowing us to solve large-scale instances of these problems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver. In Proceedings of the 27th annual ACM-SIAM symposium on Discrete algorithms, pages 1824–1831. SIAM, 2016.
  2. Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel. In Proceedings of the 26th annual ACM-SIAM symposium on Discrete algorithms, pages 1439–1456, 2014.
  3. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures, pages 119–129, 1998.
  4. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In Proceedings of IEEE Symposium on Foundations of Computer Science, 2005.
  5. The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing, 8:121–164, 2012.
  6. A combinatorial, primal-dual approach to semidefinite programs. Journal of the ACM, 63(2):1–35, 2016.
  7. Smaller core-sets for balls. In SODA, volume 3, pages 801–802, 2003.
  8. Non-Euclidean restricted memory level method for large-scale convex optimization. Mathematical Programming, 102(3):407–456, 2005.
  9. Duality and geometry in SVM classifiers. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 57–64, 2000.
  10. A geometric approach to support vector regression. Neurocomputing, 55(1-2):79–108, 2003.
  11. Introduction to parallel algorithms. Lecture notes, Computer Science Department, Carnegie Mellon University, Spring, 2021.
  12. Fast set operations using treaps. In Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures, pages 16–26, 1998.
  13. Multiplicative updates for online convex optimization over symmetric cones. arXiv:2307.03136, 2023.
  14. Kenneth L. Clarkson. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Transactions on Algorithms (TALG), 6(4):1–30, 2010.
  15. Support-vector networks. Machine learning, 20:273–297, 1995.
  16. Cplex, IBM ILOG. User’s Manual for CPLEX, 2023. URL: https://www.ibm.com/support/pages/cplex-optimization-studio-reference-manuals.
  17. David Crisp and Christopher J. C. Burges. A geometric interpretation of ν𝜈\nuitalic_ν-SVM classifiers. In S. Solla, T. Leen, and K. Müller, editors, Advances in Neural Information Processing Systems, volume 12. MIT Press, 1999.
  18. Martin Dyer. A class of convex programs with applications to computational geometry. In Proceedings of the 8th annual symposium on Computational Geometry, pages 9–15, 1992.
  19. Analysis on Symmetric Cones. Oxford mathematical monographs. Clarendon Press, 1994.
  20. Leonid Faybusovich. Euclidean Jordan Algebras and interior-point algorithms. Positivity, 1997.
  21. An iterative algorithm learning the maximal margin classifier. Pattern recognition, 36(9):1985–1996, 2003.
  22. Bernd Gärtner. A subexponential algorithm for abstract optimization problems. SIAM Journal on Computing, 24(5):1018–1035, 1995.
  23. Coresets for polytope distance. In Proceedings of the 25th annual symposium on Computational Geometry, pages 33–42, 2009.
  24. An efficient, exact, and generic quadratic programming solver for geometric optimization. In Proceedings of the sixteenth annual symposium on Computational geometry, pages 110–118, 2000.
  25. Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023. URL: https://www.gurobi.com.
  26. A parallel approximation algorithm for positive semidefinite programming. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pages 463–471. IEEE, 2011.
  27. Satyen Kale. Efficient Algorithms Using The Multiplicative Weights Update Method. PhD thesis, Princeton University, 2007.
  28. Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING. In STOC’96, 1996.
  29. Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions. In Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, pages 45–55, 2003.
  30. A parallel approximation algorithm for positive linear programming. In Proceedings of the 25th annual ACM symposium on Theory of Computing, pages 448–457, 1993.
  31. Linear and nonlinear programming, volume 2. Springer, 1984.
  32. Nimrod Megiddo. Linear-time algorithms for linear programming in ℝ3superscriptℝ3\mathbb{R}^{3}blackboard_R start_POSTSUPERSCRIPT 3 end_POSTSUPERSCRIPT and related problems. SIAM journal on computing, 12(4):759–776, 1983.
  33. Nimrod Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the ACM, 31(1):114–127, 1984.
  34. Finding the point of a polyhedron closest to the origin. SIAM Journal on Control, 12(1):19–26, 1974.
  35. Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research, 22(1):1–42, 1997.
  36. Approximating smallest enclosing balls with applications to machine learning. International Journal of Computational Geometry & Applications, 19(05):389–414, 2009.
  37. NVIDIA. CUDA C++ Programming Guide, 2023. URL: https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html.
  38. John Platt. Sequential minimal optimization: A fast algorithm for training support vector machines. Technical Report MSR-TR-98-14, Microsoft Research, 1998.
  39. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2):257–301, 1995.
  40. New support vector algorithms. Neural computation, 12(5):1207–1245, 2000.
  41. Second order cone programming approaches for handling missing and uncertain data. Journal of Machine Learning Research, pages 1283–1314, 2006.
  42. The Araki-Lieb-Thirring inequality and the Golden-Thompson inequality in Euclidean Jordan algebras. Linear and Multilinear Algebra, 70(19):4228–4243, 2022.
  43. The CGAL Project. CGAL User and Reference Manual, 2023. URL: https://doc.cgal.org/5.6/Manual/packages.html.
  44. Matrix exponentiated gradient updates for on-line learning and Bregman projection. Journal of Machine Learning Research, 6:995–1018, 2005.
  45. Lieven Vandenberghe. Symmetric cones. Lecture notes, Electrical and Computer Engineering Department, UCLA, Spring, 2016.
  46. MVC Vieira. Jordan algebraic approach to symmetric optimization. PhD thesis. Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, 2007.
  47. Online variance minimization. In International conference on computational learning theory, pages 514–528. Springer, 2006.
  48. Emo Welzl. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science: Graz, Austria, June 20–21, 1991 Proceedings, pages 359–370. Springer, 2005.
  49. E. Alper Yildirim. Two algorithms for the minimum enclosing ball problem. SIAM Journal on Optimization, 19(3):1368–1391, 2008.
  50. Neal E. Young. Sequential and parallel algorithms for mixed packing and covering. In Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pages 538–546. IEEE, 2001.
  51. Efficient algorithms for the smallest enclosing ball problem. Computational Optimization and Applications, 30:147–160, 2005.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now