Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster

Optimization Methods and Software

Volumn 25, Issue 3, 2010, Pages 405-420

  Ivanov, I D ^a   De Klerk, E ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

Author keywords

Distributed memory cluster; Interior point methods; Parallel computing; Semidefinite programming

Indexed keywords

ALGORITHMIC FRAMEWORK; BLOCK SIZES; DISTRIBUTED MEMORY CLUSTERS; DISTRIBUTED-MEMORY COMPUTERS; INTERIOR-POINT METHOD; LARGE-SCALE PROBLEM; LINEAR EQUALITY CONSTRAINTS; MESSAGE PASSING INTERFACE; PARALLEL COMPUTING; PARALLEL EFFICIENCY; PARALLEL IMPLEMENTATIONS; PARALLEL VERSION; POSITIVE SEMIDEFINITE MATRICES; PRIMAL-DUAL; SCALAPACK; SEMI-DEFINITE PROGRAMMING; TEST SETS;

CLUSTER COMPUTING; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; MESSAGE PASSING; PARALLEL ARCHITECTURES;

PARALLEL PROGRAMMING;

EID: 77949562988     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780903239360     Document Type: Article

References (27)

1. S.J. Benson, Parallel computing on semidefinite programs, Technical Report ANL/MCS-P939-0302, Mathematics and Computer Science Division, Argonne National Laboratory, 2003.
2. S.J. Benson,Y.Ye, and X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim. 10(2) (2000), pp. 443-461.
3. B. Borchers, CSDP, a C library for semidefinite programming, Optim. Methods Softw. 11/12(1-4) (1999), pp. 613-623.
4. B. Borchers, SDPLIB 1.2, library of semidefinite programming test problems, Optim. Methods Softw. 11/12(1-4) (1999), pp. 683-690.
5. B. Borchers and J.Young, Implementation of a primal-dual method forSDPon a shared memory parallel architecture, Comput. Optim. Appl. 37(3) (2007), pp. 355-369.
6. E. De Klerk, Aspects of Semidefinite Programming, Interior Point Algorithms and Selected Applications, Applied Optimization, Vol.65, Kluwer Academic Publishers, Dordrecht, 2002.
7. E. De Klerk, C. Roos, and T. Terlaky, Initialization in semidefinite programming via a self-dual skew-symmetric embedding, Oper. Res. Lett. 20(5) (1997), pp. 213-221.
8. E. de Klerk, G. Elabwabi, and D. den Hertog, Optimization of univariate functions on bounded intervals by interpolation and semidefinite programming, CentER Discussion Paper 2006-26, Tilburg University, The Netherlands, 2006. Available at Optimization Online.
9. G. Elabwabi, Topics in global optimization using semidefinite optimization, Ph.D. thesis, Delft University of Technology, 2007.
10. K. Fujisawa, M. Kojima, and K. Nakata, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Program. 79(1-3) (1997), pp. 235-253.
11. M. Fukuda, M. Kojima, K. Mucro, and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion. I. General framework, SIAM J. Optim. 11(3) (2000/2001), pp. 647-674.
12. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42(6) (1995), pp. 1115-1145.
13. P. Hansen, B. Jaumard, and S.-H. Lu, Global optimization of univariate Lipschitz functions. II. New algorithms and computational comparison, Math. Program. 55(3) (1992), pp. 273-292.
14. C. Helmberg and F. Rendl, Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes, Math. Program. 82(3) (1998), pp. 291-315.
15. C. Helmberg, F. Rendl, R.J. Vanderbei, and H.Wolkowicz, An interior-point method for semidefinite programming, SIAM J. Optim. 6(2) (1996), pp. 342-361.
16. J. Löfberg and P. Parrilo, From coefficients to samples: a new approach to SOS optimization, IEEE Conference on Decision and Control, Veszprém, Hungary, 13-15 December 2006.
17. H.D. Mittelman, Dimacs challenge benchmarks, 2000. Available at http://plato.asu.edu/18/.
18. R.D.C. Monteiro and P. Zanjácomo, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Optim. Methods Softw. 11/12(1-4) (1999), pp. 91-140.
19. M. Nakata, H. Nakatsuji, M. Ehara, M. Fukuda, K. Nakata, and K. Fujisawa, Variational calculations of fermion second-order reduced density matrices by semidefinite programming algorithm, J. Chem. Phys. 114(19) (2001), pp. 8282-8292.
20. K. Nakata, K. Fujisawa, M. Fukuda, M. Kojima, and K. Mucro, Exploiting sparsity in semidefinite programming via matrix completion. II. Implementation and numerical results, Math. Program. 95(2) (2003), pp. 303-327.
21. M. Ohsaki, K. Fujisawa, N. Katoh, and Y. Kanno, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, Comput. Methods Appl. Mech. Engrg. 180 (1999), pp. 203-217.
22. J.F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw. 11/12(1-4) (1999), pp. 625-653.
23. K.C. Toh and M. Kojima, Solving some large scale semidefinite programs via the conjugate residual method, SIAM J. Optim. 12(3) (2002), pp. 669-691.
24. K.C. Toh, M.J. Todd, and R.H. Tütüncü, SDPT3 - a MATLAB software package for semidefinite programming, version 1.3, Optim. Methods Softw. 11/12(1-4) (1999), pp. 545-581.
25. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev. 38 (1996), pp. 49-95.
26. M.Yamashita, K. Fujisawa, and M. Kojima, Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0), Optim. Methods Softw. 18(4) (2003), pp. 491-505.
27. M. Yamashita, K. Fujisawa, and M. Kojima, SDPARA: SemiDefinite Programming Algorithm paRAllel version, Parallel Comput. 29(8) (2003), pp. 1053-1067.