Latest Developments in the SDPA Family for Solving Large-Scale SDPs

The main purpose of this chapter is to introduce the latest developments in SDPA and its family. SDPA is designed to solve large-scale SemiDefinite Programs (SDPs) faster and over the course of 15 years of development, it has been expanded into a high-performance-oriented software package. We hope that this introduction to the latest developments of the SDPA Family will be beneficial to readers who wish to understand the inside of state-of-art software packages for solving SDPs.

[1]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[2]  Makoto Yamashita,et al.  SDPA PROJECT: SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS( the 50th Anniversary of the Operations Research Society of Japan) , 2007 .

[3]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[4]  K. Fujisawa,et al.  Variational calculations of fermion second-order reduced density matrices by semidefinite programming algorithm , 2001 .

[5]  Makoto Yamashita,et al.  A high-performance software package for semidefinite programs: SDPA 7 , 2010 .

[6]  Masakazu Muramatsu,et al.  Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization , 2012, Comput. Optim. Appl..

[7]  Masakazu Kojima,et al.  Exploiting sparsity in primal-dual interior-point methods for semidefinite programming , 1997, Math. Program..

[8]  Renato D. C. Monteiro,et al.  Primal-Dual Path-Following Algorithms for Semidefinite Programming , 1997, SIAM J. Optim..

[9]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[10]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[11]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[12]  Jack Dongarra,et al.  ScaLAPACK Users' Guide , 1987 .

[13]  Michael J. Todd,et al.  Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..

[14]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[15]  B. Borchers.  CSDP, A C library for semidefinite programming , 1999 .

[16]  Michael L. Overton,et al.  Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..

[17]  Frank Vallentin,et al.  High-Accuracy Semidefinite Programming Bounds for Kissing Numbers , 2009, Exp. Math..

[18]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[19]  Robert J. Vanderbei,et al.  An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[20]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[21]  Brian Borchers,et al.  Implementation of a primal–dual method for SDP on a shared memory parallel architecture , 2007, Comput. Optim. Appl..

[22]  Masakazu Kojima,et al.  A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion , 2006, Parallel Comput..

[23]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[24]  Luc Giraud,et al.  Algorithm 881: A Set of Flexible GMRES Routines for Real and Complex Arithmetics on High-Performance Computers , 2008, TOMS.

[25]  Patrick Amestoy,et al.  Hybrid scheduling for the parallel solution of linear systems , 2006, Parallel Comput..

[26]  Brian Borchers,et al.  SDPLIB 1.1, A Library of Semidefinite Programming Test Problems , 1998 .

[27]  Xiaoye S. Li,et al.  Quad-Double Arithmetic: Algorithms, Implementation, and Application∗ , 2007 .

[28]  Jaeyoung Choi,et al.  Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines , 1994, Sci. Program..

[29]  Shinji Hara,et al.  Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..

[30]  Masakazu Kojima,et al.  SDPARA: SemiDefinite Programming Algorithm paRAllel version , 2003, Parallel Comput..

[31]  Katsuki Fujisawa,et al.  Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results , 2003, Math. Program..

[32]  M. Kojima,et al.  Correlative Sparsity in Primal-Dual Interior-Point Methods for LP, SDP, and SOCP , 2008 .

[33]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[34]  Mituhiro Fukuda,et al.  Variational calculation of second-order reduced density matrices by strong N-representability conditions and an accurate semidefinite programming solver. , 2008, The Journal of chemical physics.

[35]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[36]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[37]  Masakazu Kojima,et al.  Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) , 2003, Optim. Methods Softw..

[38]  Tao Qin,et al.  Supervised rank aggregation , 2007, WWW '07.