General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems

Mathematics of Operations Research

Volumn 25, Issue 3, 2000, Pages 381-399

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

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

NONLINEAR SEMIDEFINITE COMPLEMENTARITY PROBLEMS;

NONLINEAR PROGRAMMING;

EID: 0343714760     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.3.381.12216     Document Type: Article

References (35)

1. Alizadeh, F. 1995. Interior point methods in semidefinite programming with application to combinatorial optimization. SIAM. J. Optim. 5 13-51.
2. _, J.-P.A. Haeberly, M. L. Overton. 1997. Complementarity and nondegeneracy in semidefinite programming. Math. Programming 77 111-128.
3. _, _, _. 1998. Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results. SIAM J. Optim. 8 746-768.
4. Ambrosetti, A., G. Prodi. 1993. A Primer of Nonlinear Analysis. Cambridge University Press, Cambridge, MA.
5. Golub, G. H., C. E. Van Loan. 1989. Matrix Computations: Second Edition. The John Hopkins University Press, Baltimore, MD.
6. Horn, R. A., C. R. Johnson. 1991. Topics in Matrix Analysis. Cambridge University Press, New York.
7. Kojima, M., M. Shida, S. Shindoh. 1997. Reduction of monotone linear complementarity problems over cones to linear programs over cones. Acta Math. Vietnamica 22 147-157.
8. _, _, _. 1998. Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Programming 80 129-160.
9. _, _, _. 1999. A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction. SIAM J. Optim. 9 444-465.
10. _, S. Shindoh, S. Hara. 1997. Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 1 86-125.
11. Luo, Z. Q., J. F. Sturm, S. Z. Zhang. 1996. Duality and self-duality for conic convex programming. Manuscript, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.
12. _, _, _. 1998. Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8 59-81.
13. Monteiro, R. D. C. 1997. Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. 1 663-678.
14. _. 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. _, J. S. Pang. 1996. Properties of an interior-point mapping for mixed complementarity problems. Math. Oper. Res. 21 629-654.
16. _, _. 1998. On two interior-point mappings for nonlinear semidefinite complementarity problems. Math. Oper. Res. 23 39-60.
17. _, _. 1999. A potential reduction Newton method for constrained equations. SIAM J. Optim. 9 729-754.
18. _, T. Tsuchiya. 1999. Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9 551-577.
19. _, P. R. Zanjácomo. 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. Optim. Meth. Software Forthcoming.
20. _, Y. Zhang. 1998. A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Programming 81 281-299.
21. Nesterov, Y. E., A. S. Nemirovskii. 1994. Interior Point Methods in Convex Programming: Theory and Application. Society of Industrial and Applied Mathematics, Philadelphia, PA.
22. _, M. J. Todd. 1997. Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22 1-42.
23. _, _. 1998. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8 324-364.
24. Ortega, J. M., W. C. Rheinboldt. 1970. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
25. Potra, F. A., R. Sheng. 1998. A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8 1007-1028.
26. Ramana, M. V., L. Tunçel, H. Wolkowicz. 1997. Strong duality for semidefinite programming. SIAM J. Optim. 7 641-662.
27. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
28. Shapiro, A. 1997. First and second order analysis of nonlinear semidefinite programs. Math. Programming 77 301-320.
29. Shida, M., S. Shindoh, 1996. Monotone semidefinite complementarity problems. Research Report B-312, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan.
30. _, S. Shindoh, M. Kojima. 1997. Centers of monotone generalized complementarity problems. Math. Oper. Res. 22 969-976.
31. _, _, _. 1998. Existence of search directions in interior-point algorithms for the SDP and the monotone SDLCP. SIAM J. Optim. 8 387-396.
32. Sturm, J. F., S. Zhang. 1996. On Weighted Centers for Semidefinite Programming. Report 9636/A, Econometric Institute, Erasmus University Rotterdam, the Netherlands. To appear in Euro. J. Oper. Res.
33. Vandenberghe, L., S. Boyd. 1996. Semidefinite programming. SIAM Rev. 38 49-95.
34. Wang, T., R. D. C. Monteiro, J.-S. Pang. 1996. An interior point potential reduction method for constrained equations. Math. Programming 74 159-195.
35. Zhang, Y. 1998. On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8 365-386.