1 |
Helmber.C, Rendl.F, Vanderbei R.J, Wolkowicz, An interior point method for semidefinite programming, SIAM Journal on Optimization. 1996, 342-361.
|
2 |
Kojima.M, Shida.M, Shindoh.S, Local convergence of predictor-corrector infeasible-interior- point algorithms for SDPs and SDLCPs. Mathematical Programming. 1998, 129-160.
|
3 |
M. Kojima S. Shindoh S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization , vol.7(1997), No.1, 86 - 125.
DOI
ScienceOn
|
4 |
R. D. C. Monteiro, Primal-Dual Path-Following Algorithms for Semidefinite Programming, SIAM Journal on Optimization, Vol.7(1997), No.3, 663 - 678.
DOI
ScienceOn
|
5 |
R. D. C. Monteiro, Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions , SIAM Journal on Optimization, Vol.8(1998), 797-812.
DOI
ScienceOn
|
6 |
R. D. C. Monteiro and Y. Zhang, A unified analysis for a class of path-following primal- dual interior-point algorithms for semidefinite programming, Math.program, 1998, 281-299.
|
7 |
R. D. C. Monteiro and Y. Zhang, Polynomial convergence of a new family of primal- dual algorithms for semidefinite programming, SIAM Journal on Optimization, Vol.9(1999), No.3, 551-577.
DOI
|
8 |
Yin Zhang, On extending some primal-dual interior-point algorithms from linear pro- gramming to semidefinite programming. SIAM Journal on Optimization. Vol.8(1998), No.2, 365-386.
DOI
ScienceOn
|
9 |
M Shida, S Shindoh, M Kojima , Existence of search directions in interior-point algorithms for the SDP and the monotone SDLCP. SIAM Journal on Optimization, Vol.8(1998), No.2, 387-396.
DOI
ScienceOn
|
10 |
F Alizadeh, JPA Haeberly, ML Overton , Primal-dual interior-point methods for semidef- inite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization. Vol.8(1998), No.3, 746-768.
DOI
ScienceOn
|
11 |
Freund, R.M, Complexity of an algorithm for finding an approximate solution of a semidefi- nite program with no regularity condition. Working paper OR 302-94. Operations Research Center, Massachusetts Institute of Technology, Cambridge, December, (1994).
|
12 |
F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5(1995), 13-51.
DOI
|
13 |
Y. E. Nesterod and A. S. Nemirovskii, A general approach to the design of optimal methods for smooth convex functions minimization, Ekonomika i Matem. Metody, 24 (1998), 509- 517(in Russian). (English transl: Matekon: translations of Russian and East European Math. Economics.)
|
14 |
Y. E. Nesterod and A. S. Nemirovskii, Interior Point methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1994.
|