TY - JOUR

T1 - A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion

AU - Nakata, Kazuhide

AU - Yamashita, Makoto

AU - Fujisawa, Katsuki

AU - Kojima, Masakazu

N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2006/1

Y1 - 2006/1

N2 - A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it features parallel computation of the elements of the Schur complement equation system and a parallel Cholesky factorization of its coefficient matrix. SDPARA can effectively solve SDPs with a large number of equality constraints; however, it does not solve SDPs with a large scale matrix variable with similar effectiveness. SDPA-C is a primal-dual interior-point method using the positive definite matrix completion technique by Fukuda et al., and it performs effectively with SDPs with a large scale matrix variable, but not with a large number of equality constraints. SDPARA-C benefits from the strong performance of each of the two methods. Furthermore, SDPARA-C is designed to attain a high scalability by considering most of the expensive computations involved in the primal-dual interior-point method. Numerical experiments with the three parallel software packages SDPARA-C, SDPARA and PDSDP by Benson show that SDPARA-C efficiently solves SDPs with a large scale matrix variable as well as a large number of equality constraints with a small amount of memory.

AB - A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it features parallel computation of the elements of the Schur complement equation system and a parallel Cholesky factorization of its coefficient matrix. SDPARA can effectively solve SDPs with a large number of equality constraints; however, it does not solve SDPs with a large scale matrix variable with similar effectiveness. SDPA-C is a primal-dual interior-point method using the positive definite matrix completion technique by Fukuda et al., and it performs effectively with SDPs with a large scale matrix variable, but not with a large number of equality constraints. SDPARA-C benefits from the strong performance of each of the two methods. Furthermore, SDPARA-C is designed to attain a high scalability by considering most of the expensive computations involved in the primal-dual interior-point method. Numerical experiments with the three parallel software packages SDPARA-C, SDPARA and PDSDP by Benson show that SDPARA-C efficiently solves SDPs with a large scale matrix variable as well as a large number of equality constraints with a small amount of memory.

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

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

U2 - 10.1016/j.parco.2005.07.002

DO - 10.1016/j.parco.2005.07.002

M3 - Article

AN - SCOPUS:29244441161

VL - 32

SP - 24

EP - 43

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 1

ER -