Centers of monotone generalized complementarity problems

Mathematics of Operations Research

Volumn 22, Issue 4, 1997, Pages 969-976

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

^a KANAGAWA UNIVERSITY   (Japan)

^b NATIONAL DEFENSE ACADEMY   (Japan)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Central trajectory; Complementarity problem; Interior point algorithm; Linear program; Path of centers

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; NUMERICAL METHODS; PROBLEM SOLVING; VECTORS;

INTERIOR POINT ALGORITHMS; MONOTONE GENERALIZED COMPLEMENTARITY PROBLEMS;

LINEAR PROGRAMMING;

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

References (19)

1. Alizadeh, F. (1995). Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 13-51.
2. Aubin, J. P., I. Ekeland (1984). Applied Nonlinear Analysis, John Wiley and Sons, New York.
3. Gowda, M. S., T. I. Seidman (1990). Generalized linear complementarity problems. Math. Programming 46 329-340.
4. Güler, O. (1993). Existence of interior points and interior paths in nonlinear monotone complementarity problems. Math. Oper. Res. 18 128-147.
5. _ (1996). Barrier functions in interior-point methods. Math. Oper. Res. 21 860-885.
6. Hogan, W. W. (1973). Point-to-set maps in mathematical programming. SIAM Rev. 15 591-603.
7. Huard, P. (1967). Resolution of mathematical programming with nonlinear constraints by the methods of centres. J. Abadie, ed., Nonlinear Programming, North-Holland, Amsterdam, 207-219.
8. Karamardian, S. (1976). Complementarity problems over cones with monotone and pseudomonotone maps. J. Optim. Theory Appl. 18 445-454.
9. Kojima, M., N. Megiddo, T. Noma, A. Yoshise (1991). A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, New York.
10. _, S. Mizuno, T. Noma (1990). Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper. Res. 15 662-675.
11. _, _, A. Yoshise (1989). A primal-dual interior point algorithm for linear programming. N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods, Springer-Verlag, New York, 29-47.
12. _, S. Shindoh, S. Hara (1997). Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7 86-125.
13. McLinden, L. (1980). The complementarity problem for maximal monotone multifunctions. R. W. Cottle, F. Giannessi, and J. L. Lions, eds., Variational Inequalities and Complementarity Problems, John Wiley and Sons, New York, 251-270.
14. Megiddo, N. (1977). A monotone complementarity problem with feasible solutions but no complementarity solutions. Math. Programming 12 131-132.
15. _ (1989). Pathways to the optimal set in linear programming. N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods, Springer-Verlag, New York, 131-158.
16. Monteiro, R. D. C., I. Adler (1989). Interior path following primal-dual algorithms. Part I: linear programming. Math. Programming 44 27-41.
17. Nesterov, Y., A. Nemirovskii (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia.
18. Sonnevend, G. (1985). An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. Lecture Notes in Control and Inform. Sci. 84, New York, Springer, 866-876.
19. Vandenberghe, L., S. Boyd (1995). A primal-dual potential reduction method for problems involving matrix inequalities. Math. Programming 69 205-236.