SDPARA: Semidefinite programming algorithm paRAllel version

M. Yamashita, Katsuki Fujisawa, M. Kojima

Research output: Contribution to journalArticle

50 Citations (Scopus)

Abstract

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
Volume29
Issue number8
DOIs
Publication statusPublished - Aug 1 2003
Externally publishedYes

Fingerprint

Semidefinite Programming
Computer programming
Semidefinite Program
Parallel algorithms
Parallel Algorithms
Programming
Program processors
Primal-dual Interior Point Method
PC Cluster
Cholesky factorisation
Schur Complement
Distributed Memory
Parallel Implementation
Factorization
Scalability
Data storage equipment
Numerical Results

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

Cite this

SDPARA : Semidefinite programming algorithm paRAllel version. / Yamashita, M.; Fujisawa, Katsuki; Kojima, M.

In: Parallel Computing, Vol. 29, No. 8, 01.08.2003, p. 1053-1067.

Research output: Contribution to journalArticle

Yamashita, M. ; Fujisawa, Katsuki ; Kojima, M. / SDPARA : Semidefinite programming algorithm paRAllel version. In: Parallel Computing. 2003 ; Vol. 29, No. 8. pp. 1053-1067.
@article{40dee3f671dd4b04a3267754f6b249a6,
title = "SDPARA: Semidefinite programming algorithm paRAllel version",
abstract = "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.",
author = "M. Yamashita and Katsuki Fujisawa and M. Kojima",
year = "2003",
month = "8",
day = "1",
doi = "10.1016/S0167-8191(03)00087-5",
language = "English",
volume = "29",
pages = "1053--1067",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - SDPARA

T2 - Semidefinite programming algorithm paRAllel version

AU - Yamashita, M.

AU - Fujisawa, Katsuki

AU - Kojima, M.

PY - 2003/8/1

Y1 - 2003/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041862659&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041862659&partnerID=8YFLogxK

U2 - 10.1016/S0167-8191(03)00087-5

DO - 10.1016/S0167-8191(03)00087-5

M3 - Article

AN - SCOPUS:0041862659

VL - 29

SP - 1053

EP - 1067

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 8

ER -