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

@article{Nakata2006APP,
  title={A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion},
  author={Kazuhide Nakata and Makoto Yamashita and Katsuki Fujisawa and Masakazu Kojima},
  journal={Parallel Computing},
  year={2006},
  volume={32},
  pages={24-43}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

E

L. S. Blackford, J. Choi, A. Cleary
  • D’Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker and R.C. Whaley, ScaLAPACK Users’ Guide, SIAM, Philadelphia
  • 1997
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL