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

References

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