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. Technical Report 721, NYU Computer Science Dept, 1996. To appear in SIAM Journal on Optimization.

2

I. Adler and F. Alizadeh. Primal-Dual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems. Technical Report RRR-111-95, RUTCOR, Rutgers University, 1995.

3

F. Alizadeh, J.-P Haeberly, M. V. Nayakankuppam, M. L. Overton, and S. Schmieta. Optimization with linear, quadratic and semidefinite constraints. In preparation, 1997.

4

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.

5

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.

6

F. Alizadeh, J.-P. Haeberly, and M. L. Overton. Complementarity and nondegeneracy in semidefinite programming. Mathematical Programming, 77:111-128, 1997.

7

M. V. Nayakkankuppam and M. L. Overton. Conditioning of semidefinite programs. Technical report, NYU Computer Science Dept, March 1997. URL: http://www.cs.nyu.edu/phd_students/madhu/sdp/papers.html.

8

F. Alizadeh, J.-P. Haeberly, M. V. Nayakkankuppam, and M. L. Overton. SDPpack user's guide, version 0.8 beta. Technical Report 734, NYU Computer Science Dept, March 1997. URL: http://www.cs.nyu.edu/phd_students/madhu/sdppack/sdppack.html.