Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 91-140

  Monteiro, Renato D C ^a   Zanjácomo, Paulo ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; POLYNOMIALS;

INTERIOR-POINT METHODS; PREDICTOR-CORRECTOR METHODS; PRIMAL-DUAL METHODS; SEMIDEFINITE PROGRAMMING (SDP);

LINEAR PROGRAMMING;

EID: 1642633464     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805749     Document Type: Article

References (34)

1. Alizadeh, F. (1995). Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization, 5(1), 13-51.
2. Alizadeh, F., Haeberly, J.-P. A. and Overton, M. L. (1998). Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM Journal on Optimization, 8, 746-768,
3. Benson, S., Ye, Y. and Zhang, X. (1998). Solving large-scale sparse semidefinite programs for combinatorial optimization. Research Report, Department of Management Science, University of Iowa, Iowa. To appear in SIAM Journal on Optimization.
4. Brixius, N., Potra, F. A. and Sheng, R. (1996). Solving semidefinite programs in Mathematics. manuscript, Department of Mathematics, The University of Iowa, Iowa city, Iowa. 52242, USA, October.
5. Freund, R. M. (1994). Complexity of an algorithm for finding an approximate solution of a semidefinite program with no regularity condition. Working paper OR 302-94, Operations Research Center, Massachusetts Institute of Technology, Cambridge, December.
6. Fujisawa, K., Kojima, M. and Nakata, K. (1997). Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Mathematical Programming, 79, 235-253.
7. Golub, G. H. and Van Loan, C. E. Matrix Computations: Second Edition. The John Hopkins University Press, Baltimore, MA 21211.
8. Gu, M. (1997). On primal-dual interior-point methods algorithms for semidefinite programming. Technical Report TR 97-12, Dept. of Mathematics , University of California, Los Angeles, CA 90095, USA.
9. Helmberg, C., Rendl, F., Vanderbei, R. J. and Wolkowicz, H. (1996). An interior-point method for semidefinite programming, SIAM Journal on Optimization, 6, 342-361.
10. Horn, R. A. and Johnson, C. R. (1985). Matrix Analysis. Cambridge University Press, New York.
11. The Math Works Inc. (1992). MATLAB Reference Guide. The Math Works Inc., Natick MA.
12. Jarre, F. (1993). An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM Journal on Control and Optimization, 31, 1360-1377.
13. Kojima, M. (1994). A primitive interior point algorithm for semidefinite programs in Mathematica. manuscript, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguru-ku, Tokyo 152, Japan, December.
14. Kojima, M., Shida, M. and Shindoh, S. (1998). Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Mathematical Programming, 80, 129-160.
15. 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.
16. Lin, C-J. and Saigal, R. (1995). A predictor-corrector method for semi-definite programming. Working paper, Dept. of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2177.
17. Luo, Z-Q., Sturm, J. F. and Zhang, S. (1998). Superlinear convergence of a symmetric primal-dual path-following algorithm for semidefinite programming, SIAM Journal on Optimization, 8, 59-81.
18. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2, 575-601.
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 Monteiro and Zhang family of directions, SIAM Journal on Optimization, 8, 797-812.
21. Monteiro, R. D. C., Adler, I. and Resende, M. G. C. (1990). A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Mathematics of Operations Research, 15, 191-214.
22. 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.
23. Monteiro, R. D. C. and Tsuchiya, T. (1999). Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions, Mathematical Programming, 84, 39-53.
24. 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.
25. Nesterov, Y. E. and Nemirovskii, A. S. (1994). Interior Point Methods in Convex Programming: Theory and Applications. Society for Industrial and Applied Mathematics, Philadelphia.
26. Nesterov, Y. E. and Todd, M. (1997). Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research, 22, 1-42.
27. Nesterov, Y. E. and Todd, M. (1998). Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization, 8, 324-364.
28. Potra, F. A. and Sheng, S. (1998). A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming, SIAM Journal on Optimization, 8, 1007-1028.
29. Sturm, J. F. and Zhang, S. (1999). Symmetric primal-dual path-following algorithms for semidefinite programming, Applied Numerical Mathematics, 29, 301-315.
30. 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.
31. Toh, K. C. (1997). Search directions for primal-dual interior point methods in semidefinite programming. Technical Report, Department of Mathematics, National University of Singapore, 10 Kent Ridge Crescent, 119620 Singapore, July.
32. 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.
33. Vandenberghe, L. and Boyd, S. (1995). A primal-dual potential reduction method for problems involving matrix inequalities, Mathematical Programming, 69, 205-236.
34. Zhang, Y. (1998). On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM Journal on Optimization, 8, 365-386.