Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation

Mathematical Programming, Series B

Volumn 85, Issue 1, 1999, Pages 51-80

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

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b KANAGAWA UNIVERSITY   (Japan)

^c NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

Inexact computation; Interior; Point methods; Search direction; Semidefinite linear complementarity problem; Semidefinite programming

Indexed keywords

EID: 0002443993     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050046     Document Type: Article

References (25)

1. Alizadeh, F., Haeberly, J.-P.A.,Overton, M.L.(I994): Primal-dual interior-point methods forsemidefinite programming. Technical Report 659. Computer Science Department, Courant Institute of Mathematical Sciences, New York University
2. Alizadeh, F., Haeberly, J.-P.A.,Overton, M.L. (1998): Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8, 746-768
3. Fujisawa, K., Kojima, M., Nakata, K. (1996): SDPA (semidefinite programming algorithm) - user's manual-. Technical Report B-308. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1995, Revised August 1996
4. Fujisawa, K., Kojima, M., Nakata, K. (1997): Exploiting sparsity in primal-dual interior-point-methods for semidefinite programming. Math. Program. 7, 235-253
5. Goldfarb, D., Scheinberg, K. (1997): Interior point trajectories in semidefinite programming. Working Paper. Dept. of IEOR, Columbia University, New York, NY, March 1996, Revised February 1997 (to appear in SIAM J. Optim.)
6. Graham, A. (1981): Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Limited, Wiley, New York
7. Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H. (1996): An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361
8. Kojima, M., Shida, M., Shindoh, S. (1998): Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Program. 80, 129-160
9. Kojima, M., Shindoh, S., Hara, S. (1997): Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86-125
10. Lin, C.-J., Saigal, R. (1995): A predictor-corrector method for semi-definite linear programming. Working paper. Dept. of Industrial Engineering and Operations Engineering, The University of Michigan, Ann Arbor, Michigan, October 1995
11. Lin, C.-J., Saigal, R. (1996): Predictor-corrector method for semidefinite programming. Informs Atlanta fall meeting, Novembers 3-6, 1996
12. Mizuno, S., Jarre, F. (1996): Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. Technical Report 605. The Institute of Statistical Mathematics, Tokyo, 1996 (to appear in Math. Program.)
13. Monteiro, R.D.C. (1997): Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663-678
14. Monteiro, R.D.C. (1998): Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. 8, 797-812
15. Monteiro, R.D.C., Tsuchiya, T. (1996): Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. Technical report. School of Industrial and Systems Engineering, Georgia Tech. USA, 1996 (to appear in Math. Program.)
16. Monteiro, R.D.C., Tsuchiya, T. (1996): Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. Technical Report 627. The Institute of Statistical Mathematics, Tokyo, Japan, 1996 (to appear SIAM J. Optim.)
17. Monteiro, R.D.C., Zhang, Y. (1998): A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Program. 81, 281-300
18. Nesterov, Yu.E., Todd, M.J. (1988): Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324-364
19. Potra, F.A., Sheng, R. (1995): A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. Technical report. Computational Mathematics, Dept. of Mathematics, The University of Iowa, 1995 (to appear in SIAM J. Optim.)
20. Shida, M., Shindoh, S. (1996): Monotone semidefinite complementarity problems. Technical Report B-312. Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology
21. Sturm, J.F., Zhang, S. (1995): Symmetric primal-dual path following algorithms for semidefinite programming. Technical Report 9554/A. Econometric Institute, Erasmus University Rotterdam, Netherlands
22. Todd, M.J., Toh, K.C., Tütüncü, R.H. (1998): On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8, 769-796
23. Tseng, P. (1998): Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP. Optim. Methods Software 9, 245-268
24. Zhang, Y. (1998): On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365-386
25. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H. (1996): Semidefinite programming relaxations for the quadratic assignment problem. Technical Report 95-27. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1996 (to appear in J. Comb. Optim.)