On two interior-point mappings for nonlinear semidefinite complementarity problems

Mathematics of Operations Research

Volumn 23, Issue 1, 1998, Pages 39-60

  Monteiro, R D C ^a   Pang, Jong Shi ^b  

^a Georgia Institute of Technology   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Continuous trajectories; Generalized complementarity problems; Interior point methods; Maximal monotonicity; Mixed nonlinear complementarity problems; Monotone mappings; Nonlinear semidefinite programming; Weighted central path

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING;

INTERIOR POINT METHOD; NONLINEAR COMPLIMENTARITY PROBLEMS;

MATRIX ALGEBRA;

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

References (26)

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 (1994). Primal-dual interior-point methods for semidefinite programming, manuscript presented at the Math Programming Symposium, Ann Arbor.
3. _, _, _ (1997). Complementarity and nondegeneracy in semidefinite programming. Math. Programming 77 111-128.
4. Ambrosetti, A., G. Prodi (1993). A Primer of Nonlinear Analysis, Cambridge University Press, Cambridge.
5. Goldfarb, D., K. Scheinberg (1996). Interior point trajectories in semidefinite programming, manuscript, Department of Industrial Engineering and Operations Research, Columbia University, New York.
6. Kojima, M., M. Shida, S. Shindoh (1995a). Reduction of monotone linear complementarity problem over cones to linear programs over cones, Research Report B-296, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan.
7. _, _, _ (1995b). Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Research Report B-306, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan. Math. Programming (to appear).
8. _, _, _ (1996). A predictor-corrector interior-point methods for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, Research Report B-311. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan.
9. _, S. Shindoh, S. Hara (1997). Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7 86-125.
10. Luo, Z. Q., J. F. Sturm, S. Z. Zhang (1996a). Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, manuscript. Econometric Institute, Erasmus University, Rotterdam, The Netherlands. SIAM J. Optim. (to appear).
11. _, _, _ (1996b). Duality and self-duality for conic convex programming, manuscript, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.
12. Monteiro, R. D. C. (1997). Primal-dual path-following algorithms for semidefinite programming SIAM J. Optim. 7663-678.
13. _, J. S. Pang (1996). Properties of an interior-point mapping for mixed complementarity problems. Math. Oper. Res. 21 629-654.
14. Nesterov, Y. E , A. S. Nemirovskii (1994). Interior Point Methods in Convex Programming: Theory and Application, Society of Industrial and Applied Mathematics, Philadelphia.
15. _, M. J. Todd (1995). Primal-dual interior-point methods for self-scaled cones, Technical Report No. 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca. SIAM J. Optim. (to appear).
16. _, _ (1997). Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22 1-42.
17. Ortega, J. M., W. C. Rheinboldt (1970). Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York.
18. Potra, F. A., R. Sheng (1995). A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming, Report on Computational Mathematics No. 78, Department of Mathematics, The University of Iowa, Iowa. SIAM J. Optim. (to appear).
19. Ramana, M. V., L. Tunçel, H. Wolkowicz (1997). Strong duality for semidefinite programming. SIAM J. Optim. 7 641-662.
20. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press, Princeton, New Jersey.
21. Shapiro, A. (1997). First and second order analysis of nonlinear semidefinite programs. Math. Programming 77 301-320.
22. 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.
23. _, _, M. Kojima (1997). Centers of monotone generalized complementarity problems. Math. Oper. Res. 22 969-976.
24. _, _, _ (1996). Existence of search directions in interior-point algorithms for the SDP and the monotone SDLCP, Research Reports B-310, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan. SIAM J. Optim. (to appear).
25. Vandenberghe, L., S. Boyd (1996). Semidefinite programming. SIAM Rev. 38 49-95.
26. Zhang, Y. (1995). On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report 95-20, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore. SIAM J. Optim. (to appear).