参考文献

1

F. Alizadeh, J.-P. A. Haeberly and M. L. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM Journal on Optimization 8 (1998) 746-768.

2

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

3

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

4

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.

5

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.

6

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

7

R. D. C. Monteiro and Y. Zhang, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Mathematical Programming 81 (1998) 281-299.

8

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

9

M. J. Todd, Semidefinite optimization, Acta Numerica 10 (2001) 515-560.

10

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

11

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