نتایج جستجو برای: solution mapping

تعداد نتایج: 653311  

Journal: :BMC Medical Informatics and Decision Making 2015

Journal: :The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences 2019

1998
Yun-Bin Zhao Duan Li

We study several properties of a homotopy solution mapping, based on Zhang and Zhang's homotopy formulation, for continuous nonlinear complementarity problems with such non-monotone maps as quasi-monotone, E 0-, and exceptional regular functions. For these classes of complementarity problems, we establish several suucient conditions to assure the nonemptyness and boundedness of the homotopy sol...

A. ‎Razani, R. Moradi

‎In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...

Journal: :Journal of Inequalities and Applications 2021

Abstract In this paper, we deal with the sensitivity analysis in vector equilibrium problems by using S -derivative of a set-valued mapping. We first investigate on kind gap function for problems. Based these results, estimations perturbed mapping parametric problem are given. Moreover, provide some examples to illustrate obtained results. Finally, derive solutions via variational system.

Journal: :Proceedings of the American Mathematical Society 1978

2005
G. Xu C. Hoede H. Sun

Bumb and Hoede have shown that a cooperative game can be split into two games, the reward game and the fine game, by considering the sign of quantities c v S in the c-diagram of the game. One can then define a solution x for the original game as x = x r − x f , where x r is a solution for the reward game and x f is a solution for the fine game. Due to the distinction of cooperation rewards and ...

Journal: :SIAM Journal on Optimization 2017
Chao Ding Defeng Sun Liwei Zhang

This paper is devoted to studying the robust isolated calmness of the Karush– Kuhn–Tucker (KKT) solution mapping for a large class of interesting conic programming problems (including most commonly known ones arising from applications) at a locally optimal solution. Under the Robinson constraint qualification, we show that the KKT solution mapping is robustly isolated calm if and only if both t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید