英语人>词典>汉英 : 弱有界集 的英文翻译,例句
弱有界集 的英文翻译、例句

弱有界集

词组短语
weakly bounded set
更多网络例句与弱有界集相关的网络例句 [注:此内容来源于网络,仅供参考]

Under the assumption that the constrained set is bounded and nonempty , we discussed the geometric properties of the feasible set for MFBLP model and Optimality conditions of MFBLP .

在约束集为非空有界的前提下讨论了可行集的几何性质,得到了可行集为约束集的若干个面的并,可行集为弱拟凸集等一些较好的几何性质。

In this paper,with the aid of the w~*- sequential compactness of bounded closed balls in the conjugate space of a separable space,we proved that the convex hull of a finite union of bounded closed balls in l~∞ is closed.

借助可分空间的共轭空间中有界闭球的弱星序列紧性,证明在无穷维数列空间l∞中有限个闭球之并的凸包仍为闭集

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法,而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点;给出了保证计算有界的一个充分条件,我们的条件大大弱于Mdrrill条件,我们的算法也可用来计算Eaves不动点;给出了集值非线性互补问题存在解的一个充分条件,此时可利用Leray-Schauder不动点算法来求解;向量标号算法以往是计算集值映射不动点的唯一有效算法,我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法;定义在紧凸集上的连续映射不一定有不动点,但一定有最近点,最近点是不动点概念的推广,我们给出了计算最近点的算法;集值映射变分不等式尚无有效的求解算法,我们给出求解一类集值映射变分不等式的算法。

The problem that under what conditions the - resolvent operator of a maximal TJ - monotone set-valued mapping is a Lipschitz continuous single-valued mapping on whole space, which also answers the open problem mentioned above, is studied on finite dimensional Euclidean spaces.

借助于图收敛理论证明了有限维欧氏空间中的两个极大单调集值映射的和映射在较弱条件下仍是极大单调集值映射,并在此基础上讨论了一般集值变分包含问题解集的凸性、闭性和有界性。

更多网络解释与弱有界集相关的网络解释 [注:此内容来源于网络,仅供参考]

weakly bounded set:弱有界集

weakly basic anion exchange fibre 弱碱性阴离子交换纤维 | weakly bounded set 弱有界集 | weakly caking coal 弱粘结煤

weakly efficient point:弱有效点

弱有界集[合]|weakly bounded set | 弱有效点|weakly efficient point | 弱有效解|weakly efficient solution