参考文献

1

E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Cros, A. Greenbaum, S. Hammarling, A. McKenney and D. Sorensen, LAPACK Users' Guide, SIAM, Philadelphia (1999).

2

A. Ben-Tal and A. Nemirovskii, Lectures on Modern Convex Optimization Analysis, Algorithms, and Engineering Applications, SIAM, Philadelphia (2001).

3

L.S. Blackford, J. Choi, A. Cleary, E. 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).

4

B. Borchers, SDPLIB 1.2, a library of semidefinite programming test problems, Optimization Methods and Software, 11 & 12 (1999) 683-690.

5

K. Fujisawa, M. Fukuda, M. Kojima and K. Nakata, Numerical evaluation of the SDPA (semidefinite programming algorithm), High Performance Optimization Techniques, Kluwer Academic Publishers, Massachusetts (2000) 267-301.

6

K. Fujisawa, M. Fukuda and K. Nakata, Preprocessing sparse semidefinite programs via matrix completion, Journal of Optimization Methods and Software, to appear.

7

K. Fujisawa, M. Kojima and K. Nakata, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Mathematical Programming, 79 (1997) 235-253.

8

M. Fukuda, M. Kojima, K. Murota and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: General framework, SIAM Journal on Optimization, 11 (2000) 647-674.

9

W. Gropp, E. Lusk and A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface, MIT Press, Massachusetts (1994).

10

C. Helmberg, F. Rendl, R. J. Vanderbei and H. Wolkowicz, An interior-point method for semidefinite programming, SIAM Journal on Optimization, 6 (1996) 342-361.

11

K. Kobayashi, K. Nakata, and M. Kojima, A conversion of an SDP having free variables into the standard form SDP, Research Report B-416, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo 152-8552 (2005).

12

M. Kojima, M. Shida and S. Shindoh, Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation, Mathematical Programming, 85 (1999) 51-80.

13

M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM Journal on Optimization, 7 (1997) 86-125.

14

R. D. C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM Journal on Optimization, 7 (1997) 663-678.

15

K. Nakata, K. Fujisawa, M. Fukuda, M. Kojima and K. Murota, Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results, Mathematical Programming, 95 (2003) 303-327.

16

K. Nakata, K. Fujisawa and M. Kojima, Using the conjugate gradient method in interior-point methods for semidefinite programs (in Japanese), Proceedings of the Institute of Statistical Mathematics, 46 (1998) 297-316.

17

K. Nakata, M. Yamashita, K. Fujisawa, and M. Kojima, A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion, Parallel Computing, 32 (2006) 24-43.

18

Yu. E. Nesterov and M. J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization 8 (1998) 324-364.

19

L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49-95.

20

H. Wolkowicz, R. Saigal and L. Vandenberghe, eds., Handbook of Semidefinite Programming, Theory, Algorithms, and Applications, Kluwer Academic Publishers, Massachusetts (2000).

21

M. Yamashita, K. Fujisawa and M. Kojima, Implementation and evaluation of SDPA6.0 (SemiDefinite Programming Algorithm 6.0), Optimization Methods and Software, 18 (2003) 491-505.

22

M. Yamashita, K. Fujisawa and M. Kojima, SDPARA: SemiDefinte Programming Algorithm PARAllel version, Parallel Computing, 29 (2003) 1053-1067.