Study of search directions in primal-dual interior-point methods for semidefinite programming

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 1-46

  Todd, M J ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

PRIMAL-DUAL INTERIOR-POINT METHODS; SEARCH DIRECTION; SEMIDEFINITE PROGRAMMING (SDP);

MATHEMATICAL PROGRAMMING;

EID: 0033296734     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805745     Document Type: Article

References (38)

1. Alizadeh, F. (1991). Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. thesis, University of Minnesota, Minneapolis, MN.
2. Alizadeh, F. Semidefinite programming home page, http://rutcor.rutgers.edu/alizadeh/sdp.html
3. Alizadeh, F., Haeberly, J. A. and Overton, M. (1998). Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM Journal on Optimization, 8, 746-768.
4. Ando, T. (1979). Concavity of certain maps and positive definite matrices and applications to Hadamard products, Linear Algebra and its Applications, 26, 203-241.
5. Benson, S. J., Ye, Y. and Zhang, X. (1997). Solving large-scale sparse semidefinite programs for combinatorial optimization, Working Paper, Department of Management Science, University of Iowa, IA (to appear in SIAM Journal on Optimization).
6. Goemans, M. X. (1997). Semidefinite programming in combinatorial optimization, Mathematical Programming, 79, 143-161.
7. Gu, M. (1997). On primal-dual interior point methods for semidefinite programming, CAM report 97-12, Department of Mathematics, University of California, Los Angeles, CA.
8. Helmberg, C. Semidefinite programming home page, http://www.zib.de/ helmberg/semidef.html
9. Helmberg, C., Rendl, F., Vanderbei, R. and Wolkowicz, H. (1996). An interior-point method for semidefinite programming, SIAM Journal on Optimization, 6, 342-361.
10. Helmberg, C., Rendl, F. and Weismantel, R. (1996). A semidefinite programming approach to the quadratic knapsack problem, Preprint SC 96-10, Konrad-Zuse-Zentrum fuer Informationstechnik Berlin, Berlin, Germany.
11. Horn, R. private communication, February 1996.
12. Ji, J., Potra, F. and Sheng, R. (1997). On the local convergence of a predictor-corrector method for semidefinite programming, Reports on Computational Mathematics 98, Dept. of Mathematics, The University of Iowa, IA.
13. Kojima, M., Shindoh, S. and Hara, S. (1997). Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM Journal on Optimization, 7, 86-125.
14. Kojima, M., Shida, M. and Shindoh, S. (1996). A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search directions in semidefinite programming, Technical Report B-313, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo 152, Japan, (to appear in Optimization Methods and Software).
15. Kojima, M., Shida, M. and Shindoh, S. (1999). Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation, Mathematical Programming, 85, 51-80.
16. Kruk, S., Muramatsu, M., Rendl, F., Vanderbei, R. J. and Wolkowicz, H. (1998). The Gauss-Newton direction in linear and semidefinite programming, Research Report CORR 98-16, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario.
17. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2, 575-601.
18. The MathWorks, Inc., MATLAB Reference Guide, The MathWorks, Inc., Natick, MA, 1992.
19. Monteiro, R. D. C. (1997). Primal-dual path following algorithms for semidefinite programming, SIAM Journal on Optimization, 7, 663-678.
20. Monteiro, R. D. C. (1998). Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions, SIAM Journal on Optimization, 8, 797-812.
21. Monteiro, R. D. C. and Tsuchiya, T. (1999). Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming, SIAM Journal on Optimization, 9, 551-577.
22. Monteiro, R. D. C. and Zhang, Y. (1998). A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming, Mathematical Programming, 81, 281-299.
23. Monteiro, R. D. C. and Zanjacomo, P. R. (1997). A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming, Mathematical Programming, 78, 393-396.
24. Monteiro, R. D. C. and Zanjacomo, P. R. (1997). Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, manuscript, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (to appear in Optimization Methods and Software).
25. Nesterov, Yu. and Nemirovskii, A. S. (1992). Conic formulation of a convex programming problem and duality, Optimization Methods and Software, 1(2), 95-115.
26. Nesterov, Yu. E. and Nemirovskii, A. S. (1994). Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM Publications, SIAM, Philadelphia, USA.
27. Nesterov, Yu. and Todd, M. J. (1997). Self-scaled barriers and interior-point methods in convex programming, Mathematics of Operations Research, 22, 1-42.
28. Nesterov, Yu. and Todd, M. J. (1998). Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization, 8, 324-354.
29. Shida, M. private communication, October 1997.
30. Shida, M., Shindoh, S. and Kojima, M. (1998). Existence and uniqueness of search directions in interior-point algorithms for the SDP and the monotone SDLCP, SIAM Journal on Optimization, 8, 387-396.
31. Todd, M. J., Toh, K. C. and Tütüncü, R. H. (1998). On the Nesterov-Todd direction in semidefinite programming, SIAM Journal on Optimization, 8, 769-796.
32. Toh, K. C. (1997). Search directions for primal-dual interior point methods in semidefinite programming, Technical Report, Department of Mathematics, National University of Singapore, Singapore.
33. Toh, K. C., Todd, M. J. and Tütüncü, R. H. (1996). SDPT3 - a MATLAB software package for semidefinite programming, (to appear in Optimization Methods and Software).
34. Tseng, P. (1998). Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP, Optimization Methods and Software, 9, 245-268.
35. Tseng, P. (1996). Further notes on the existence of search directions in interior-point methods for the monotone semi-definite LCP, Technical Report, Department of Mathematics, University of Washington, Seattle, WA.
36. Tunçel, L. (1998). Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization, Mathematics of Operations Research, 23, 708-718.
37. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming, SIAM Review, 38, 49-95.
38. Zhang, Y. (1998). On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM Journal on Optimization, 8, 365-386.