Skip to main content
SpringerLink
Log in

A parallel interior point decomposition algorithm for block angular semidefinite programs

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We present a two phase interior point decomposition framework for solving semidefinite (SDP) relaxations of sparse maxcut, stable set, and box constrained quadratic programs. In phase 1, we suitably modify the matrix completion scheme of Fukuda et al. (SIAM J. Optim. 11:647–674, 2000) to preprocess an existing SDP into an equivalent SDP in the block-angular form. In phase 2, we solve the resulting block-angular SDP using a regularized interior point decomposition algorithm, in an iterative fashion between a master problem (a quadratic program); and decomposed and distributed subproblems (smaller SDPs) in a parallel and distributed high performance computing environment. We compare our MPI (Message Passing Interface) implementation of the decomposition algorithm on the distributed Henry2 cluster with the OpenMP version of CSDP (Borchers and Young in Comput. Optim. Appl. 37:355–369, 2007) on the IBM Power5 shared memory system at NC State University. Our computational results indicate that the decomposition algorithm (a) solves large SDPs to 2–3 digits of accuracy where CSDP runs out of memory; (b) returns competitive solution times with the OpenMP version of CSDP, and (c) attains a good parallel scalability. Comparing our results with Fujisawa et al. (Optim. Methods Softw. 21:17–39, 2006), we also show that a suitable modification of the matrix completion scheme can be used in the solution of larger SDPs than was previously possible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benson, S., Ye, Y., Zhang, X.: Solving large scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10, 443–461 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)

    MATH  Google Scholar 

  3. Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1–29. Springer, New York (1993)

    Google Scholar 

  4. Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11–12, 613–623 (1999). Available at https://projects.coin-or.org/Csdp/

    Article  MathSciNet  Google Scholar 

  5. Borchers, B.: SDPLIB 1.2. A library of semidefinite programming test problems, Optim. Methods Softw. 11, 683–690 (1999). Available at http://infohost.nmt.edu/~sdplib/

    MathSciNet  Google Scholar 

  6. Borchers, B., Young, J.: Implementation of a primal-dual method for SDP on a shared memory parallel architecture. Comput. Optim. Appl. 37, 355–369 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low rank factorization. Math. Program. 95, 329–357 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. ILOG CPLEX: High performance software for mathematical programming. http://www.ilog.com/products/cplex/

  9. de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic, Dordrecht (2002)

    MATH  Google Scholar 

  10. Fujisawa, K., Fukuda, M., Nakata, K.: Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21, 17–39 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11, 647–674 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Goemans, M., Williamson, D.P.: Improved approximation algorithms for max cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42, 1115–1145 (1995)

    MATH  MathSciNet  Google Scholar 

  13. Grone, R., Johnson, C.R., Sá, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109–124 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  14. Helmberg, C.: Numerical evaluation of spectral bundle method. Math. Program. 95, 381–406 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Helmberg, C., Kiwiel, K.C.: A spectral bundle method with bounds. Math. Program. 93, 173–194 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673–696 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hiriart-Urruty, J.B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms, vol. II. Springer, Berlin (1993)

    Google Scholar 

  18. Kiwiel, K.C.: An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27, 320–341 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kiwiel, K.C.: Proximity control in bundle methods for convex nondifferentiable optimization. Math. Program. 46, 105–122 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Langbort, C., D’Andrea, R., Xiao, L., Boyd, S.: A decomposition approach to distributed analysis of networked systems. In: Proceedings of the 43rd IEEE Conference on Decision and Control, pp. 3980–3985

  21. Mehrotra, S., Özevin, M.G.: Decomposition based interior point methods for two-stage stochastic semidefinite programming. SIAM J. Optim. 18, 206–222 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Karypis, G., Kumar, V.: METIS—A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, version 4.0. Department of Computer Science, University of Minnesota (1998). Available at http://glaros.dtc.umn.edu/gkhome/views/metis

  23. Monteiro, R.D.C.: First and second order methods for semidefinite programming. Math. Program. 97, 209–244 (2003)

    MATH  MathSciNet  Google Scholar 

  24. Nakata, K., Fujisawa, K., Fukuda, M., Kojima, M., Murota, K.: Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results. Math. Program. 95, 303–327 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  25. Nayakkankuppam, M.V.: Solving large-scale semidefinite programs in parallel. Math. Program. 109, 477–504 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  26. Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkhäuser, Basel (2005)

    MATH  Google Scholar 

  27. Pacheco, P.S.: Parallel Programming with MPI. Morgan Kaufmann, San Mateo (1997)

    MATH  Google Scholar 

  28. Ruszczyński, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  29. Ruszczyński, A., Shapiro, A. (eds.): Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  30. Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11–12, 625–653 (1999). Available at http://sedumi.mcmaster.ca/

    Article  MathSciNet  Google Scholar 

  31. Tütüncü, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189–217 (2003). Available at http://www.math.nus.edu.sg/~mattohkc/sdpt3.html

    Article  MATH  MathSciNet  Google Scholar 

  32. SPOOLES 2.2: Sparse Object Oriented Linear Equations Solver. Available at http://www.netlib.org/linalg/spooles/spooles.2.2.html

  33. Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218–242 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  34. Yamashita, M., Fujisawa, K., Kojima, M.: SDPARA: SemiDefinite Programming Algorithm PARAllel version. Parallel Comput. 29, 1053–1067 (2003). Available at http://grid.r.dendai.ac.jp/sdpa/sdpa.6.00/sdpara.index.html

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, North Carolina State University, Raleigh, NC, 27695-8205, USA

    Kartik Krishnan Sivaramakrishnan

Authors
  1. Kartik Krishnan Sivaramakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kartik Krishnan Sivaramakrishnan.

Additional information

Supported by a startup grant from NC State University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sivaramakrishnan, K.K. A parallel interior point decomposition algorithm for block angular semidefinite programs. Comput Optim Appl 46, 1–29 (2010). https://doi.org/10.1007/s10589-008-9187-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-008-9187-4

Keywords

Search

Navigation