Existence and uniqueness of search directions in interior-point algorithms for the SDP and the monotone SDLCP

SIAM Journal on Optimization

Volumn 8, Issue 2, 1998, Pages 387-396

  Shida, Masayuki ^a   Shindoh, Susumu ^b   Kojima, Masakazu ^c  

^a KANAGAWA UNIVERSITY   (Japan)

^b NATIONAL DEFENSE ACADEMY   (Japan)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Interior point algorithm; Monotonicity; Semidefinite linear complementarity problem; Semidefinite program

Indexed keywords

EID: 0032222084     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496300611     Document Type: Article

References (21)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. F. ALIZADEH, J.-P. HAEBERLY, AND M. OVERTON, Primal-Dual Interior-Point Methods for Semidefinite Programming, Tech. report 659, Computer Science Department, Courant Institute of Mathematical Sciences, New York University, New York, 1994.
3. J. AUBIN AND I. EKELAND, Applied Nonlinear Analysis, John Wiley and Sons, New York, 1984.
4. A. GRAHAM, Kronecker Products and Matrix Calculus with Applications, Ellis Horwood Limited, John Wiley & Sons, New York, 1981.
5. O. GÜLER, Generalized linear complementarity problems, Math. Oper. Res., 20 (1995), pp. 441-448.
6. C. HELMBERG, F. RENDL, R. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
7. S. KARAMARDIAN, Complementarity problems over cones with monotone and pseudomonotone maps, J. Optim. Theory Appl., 18 (1976), pp. 445-454.
8. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, New York, 1991.
9. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
10. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 29-47.
11. M. KOJIMA, M. SHIDA, AND S. SHINDOH, A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, SIAM J. Optim., to appear.
12. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
13. G. MINTY, Monotone (nonlinear) operators in Hilbert space, Duke Math. J., 29 (1962), pp. 341-346.
14. R. MONTEIRO, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 663-678.
15. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
16. Y. NESTEROV AND M. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
17. M. SHIDA, S. SHINDOH, AND M. KOJIMA, Centers of monotone generalized complementarity problems, Math. Oper. Res., 22 (1997), pp. 969-976.
18. K. TANABE, Centered Newton methods for mathematical programming, in System Modeling and Optimization, M. Iri and K. Yajima, eds., Springer-Verlag, New York, 1988, pp. 197-206.
19. M. TODD, K. TOH, AND R. TÜTÜNCÜ, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., to appear.
20. T. TSUCHIYA, A New Family of Polynomial-Time Interior Point Algorithms for Linear Proramming, Tech. report, The Institute of Statistical Mathematics, Minato-ku, Tokyo, Japan, 1994.
21. L. VANDENBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming, 69 (1995), pp. 205-236.