Abstract
Tarski's fixed point theorem is extended to the case of set-valued mappings, and is applied to a class of complementarity problems defined by isotone set-valued operators in a complete vector lattice.
This is a preview of subscription content, log in via an institution to check access.
References
R.W. Cottle and J.S. Pang, “A least element theory of solving linear complementarity problems as linear programs”,Mathematics of Operations Research 3 (1978) 155–170.
C.W. Cryer and M.A.H. Dempster, “Equivalence of linear complementarity problems and linear programs in vector lattice Hilbert spaces”,SIAM Journal on Control and Optimization 18 (1980) 76–90.
T. Fujimoto, “Nonlinear Complementarity problems in a function space”,SIAM Journal on Control and Optimization 18 (1980) 621–623.
R.C. Riddell, “Equivalence of nonlinear complementarity problems and least element problems in Banach lattices”,Mathematics of Operations Research 6 (1981) 462–474.
A. Tarski, “A lattice-theoretical fixpoint theorem and its applications”,Pacific Journal of Mathematics 5 (1955) 285–309.
K. Yosida,Functional Analysis (Springer, Berlin, 1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fujimoto, T. An extension of Tarski's fixed point theorem and its application to isotone complementarity problems. Mathematical Programming 28, 116–118 (1984). https://doi.org/10.1007/BF02612716
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612716