Abstract
In this paper, a new concept of weakly convex graph for set-valued mappings is introduced and studied. By using the concept, some new coincidence, the best approximation and fixed point theorems are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Fan, Extension of two fixed point theorems of F. E. Browder,Math. Z.,112 (1969), 234–240.
X. P. Ding and K. K. Tan, A set-valued generalization of Fan's best approximation theorem,Can. J. Math.,44, 4 (1992), 783–796.
X. P. Ding and E. Tarafdar, Some further generalizations of Ky Fan's best approximation theorem,J. Approx. Theory,81, 3 (1995), 406–420.
F. E. Browder, On a sharpened form of the Schauder fixed point theorem,Proc. Nat. Acad. Sci., USA,74 (1977), 4749–4751.
C. W. Ha, Minimax and fixed point theorem,Math. Ann.,248 (1980), 73–77.
C. W. Ha, On a minimax inequality of Ky Fan,Proc. Amer. Math. Soc.,99 4 (1987), 680–682.
S. Park, Fixed point theorems on compact convex sets in topological vector spaces,Contemp. Math.,72 (1988), 183–191.
S. Reich, Approximate selections, best approximations, fixed points and invariant sets,J. Math. Anal. Appl.,62 (1978), 104–113.
Author information
Authors and Affiliations
Additional information
Project supported by the Natural Science Foundation of Sichuan Education Committee, P. R. China
Rights and permissions
About this article
Cite this article
Xieping, D., Yiran, H. Best approximation theorem for set-valued mappings without convex velues and continuity. Appl Math Mech 19, 831–836 (1998). https://doi.org/10.1007/BF02458237
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02458237