SDPARA: Semidefinite programming algorithm paRAllel version

M. Yamashita, K. Fujisawa, M. Kojima

Research output: Contribution to journalArticlepeer-review

52 Citations (Scopus)


The SDPA (SemidDefinite Programming Algorithm) is known as efficient computer software based on the primal-dual interior-point method for solving SDPs (SemiDefinite Programs). In many applications, however, some SDPs become larger and larger, too large for the SDPA to solve on a single processor. In execution of the SDPA applied to large scale SDPs, the computation of the so-called Schur complement matrix and its Cholesky factorization consume most of the computational time. The SDPARA (SemiDefinite Programming Algorithm paRAllel version) is a parallel version of the SDPA on multiple processors and distributed memory, which replaces these two parts by their parallel implementation using MPI and ScaLAPACK. Through numerical results, we show that the SDPARA on a PC cluster consisting of 64 processors attains high scalability for large scale SDPs without losing the stability of the SDPA.

Original languageEnglish
Pages (from-to)1053-1067
Number of pages15
JournalParallel Computing
Issue number8
Publication statusPublished - Aug 2003
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence


Dive into the research topics of 'SDPARA: Semidefinite programming algorithm paRAllel version'. Together they form a unique fingerprint.

Cite this