References

1

F. Alizadeh, J.-P. Haeberly, and M. L. Overton. Primal-dual interior-point methods for semidefinite programming: convergence rates, stability, and numerical methods. In revision for SIAM Journal on Optimization, 1997.

2

M. Kojima, M. Shida, and S. Hara. Interior-point methods for the monotone linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 6:86--125, 1997.

3

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

4

F. Alizadeh, J.-P. Haeberly, and M. L. Overton. Complementarity and nondegeneracy in semidefinite programming. Mathematical Programming, 1997. To appear.

5

M. V. Nayakkankuppam and M. L. Overton. Conditioning of semidefinite programs. Technical report, Courant Institute of Mathematical Sciences, New York University, March 1997. URL: http://www.cs.nyu.edu/phd_students/madhu/sdp/papers.html

6

S. Boyd and L. Vandenberghe. SP: Software for semidefinite programming (User's Guide), beta version edition, November 1994. http://WWW-ISL.Stanford.EDU/ boyd/SP.html.

7

K. Fujisawa, M. Kojima, and K. Nakata. SDPA: Semidefinite programming algorithm. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, revised edition, August 1996.