A REMARK ON THE DERIVATE OF SET-VALUED MAPPING

ＡＲＥＭＡＲＫＯＮＴＨＥＤＥＲＩＶＡＴＥＯＦＳＥＴ－ＶＡＬＵＥＤＭＡＰＰＩＮＧ￥ＣｈｅｎＢｉｎｇ（Ｄｅｐｔ．ｏｆＭａｔｈ．ＪｉｎｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅＪｉｎｚｈｏｕ１２１００３）Ａｂｓｔｒａｃｔ：Ｔｈｅｄｅｒｉｖａｔｅｏｆｓｅｔ－ｖａ...

THE EXISTENCE THEOREM OF THE CONE-WEAK SUBDIFFERENTIAL OF SET-VALUED MAPPING

In this paper, the existence theorem of the cone weak subdifferential of set valued mapping in locally convex topological vector space is proved. Received March 30,1998. 1991 MR Subject Classification: 47H17,90C29.

Iterative Approximation with Errors for Generalized Set-Valued Strongly Accretive Mapping in Banach Spaces

A new concept of generalized set-valued strongly accretive mappings in Banach spaces was given and some strong convergence theorems of Ishikawa and Mann iterative process with errors approximation methods by Huang et al. was proved. The results presented in this paper improve and extend the earlier results obtained by Huang et al.

Iterative Processes with Errors for Generalized Set-Valued φ-Hemi-contractive Mapping in Banach Spaces

A new conception of generalized set-valued Ф-hemi-contractive mapping in Banach spaces is presented. Some strong convergence theorems of Ishikawa and Mann iterative approximation with errors is proved. The results in this paper improve and extend the earlier results.

ON THE GENERALIZED FRITZ JOHN OPTIMALITY CONDITIONS OF VECTOR OPTIMIZATION WITH SET-VALUED MAPS UNDER BENSON PROPER EFFICIENCY

A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.

Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces

Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.

ε-super Effcient Solutions of Optimization Problems with Set-valued Maps in Locally Convex Space

In this paper,the ε-super effcient solution for set-valued map vector optimization in locally convex space is introduced.And under the assumption of the nearly generalized cone-subconvexlikeness for set-valued maps,used new methods,the scalarization theorem and Lagrange multiplier theorem for ε-super effcient solution are established.

An Equivalent Condition for （K） Integrability of Fuzzy-valued Mappings

In this paper, we first discuss the relationship between the McShane integral and Pettis integral for vector-valued functions. Then by using the embedding theorems for the fuzzy number space E^1, we give a new equivalent condition for （K） integrabihty of a fuzzy set-valued mapping F ： [a, b] → E^1.

THE OPTIMALITY CONDITIONS OF NONCONVEXSET-VALUED VECTOR OPTIMIZATION

The concepts of alpha-order Clarke's derivative, alpha-order Adjacent derivative and alpha-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Auxiliary principle and three-step iterative algorithms for generalized set-valued strongly nonlinear mixed variational-like inequalities

An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.

SET VALUE MAPPING AND ITS APPLICATION

The dynamics of set value mapping is considered. For the upper semi-continuous set value maps, the existence of attractors under some conditions and the upper semi-continuity of attractors under the perturbation are proved. Its application in numerical simulation of differential equation is also considered. The upper semi-continuity of attractors in set value maps under the perturbation is used to show the reasonable of subdivision algorithm and interval arithmetic in numerical simulation of differential equation.

Set-Valued Non-Linear Random Implicit Quasivariational Inclusions

In this paper, we propose iterative algorithms for set valued nonlinear random implicit quasivariational inclusions. We define the related random implicit proximal operator equations and establish an equivalence between them. Finally, we prove the existence and convergence of random iterative sequences generated by random iterative algorithms.

Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities

A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.

Completely Generalized Strongly Set-valued Nonlinear Quasi-complementarity Problems

In this paper,we study a class of completely generalized strongly set-valued nonlinearquasi-complementarity problems and discuss the existence of solutions for this kind of quasi-complementariy problems without compactness and the convergence of iterative sequencesgenerated by the algorithms.

Gap Functions and Error Bounds for Set-Valued Vector Quasi Variational Inequality Problems

One of the classical approaches in the analysis of a variational inequality problem is to transform it into an equivalent optimization problem via the notion of gap function. The gap functions are useful tools in deriving the error bounds which provide an estimated distance between a specific point and the exact solution of variational inequality problem. In this paper, we follow a similar approach for set-valued vector quasi variational inequality problems and define the gap functions based on scalarization scheme as well as the one with no scalar parameter. The error bounds results are obtained under fixed point symmetric and locally α-Holder assumptions on the set-valued map describing the domain of solution space of a set-valued vector quasi variational inequality problem.

Sensitivity of the Product System of Set-Valued Non-Autonomous Discrete Dynamical Systems

This paper is concerned with the sensitivity of set-valued discrete systems. Firstly, this paper obtained the equivalence between or and the product system in sensitivity, infinite sensitivity, F-sensitivity, (F1, F2)-sensitivity. Then, the relation between (X, f1,∞) or (Y, g1,∞) and in ergodic sensitivity is obtained. Where is the set-valued dynamical system induced by a non-autonomous discrete dynamical system (X, f1,∞).

集值映射的Michel-Penot方向导数与Michel-Penot次微分

采用标量化方法,研究集值映射的方向导数和次微分.借助Gerstewizt函数,给出了集值映射的Michel-Penot方向导数和Michel-Penot次微分的概念,研究了它们的性质,建立了它们的计算法则,并利用Michel-Penot次微分给出了无约束集值优化问题的优化条件.

图-凸集值映射的性质

借助回收映射和余切导数得到了图-凸集值映射的两个性质.

Self-organizing Map Method Based on Real Rough Sets Space and Its Application of Pattern Recognition

This paper presents a real rough sets space and corresponding concepts of real lower and upper approximation sets which correspond to the real-valued attributes. Therefore, the real rough sets space can be investigated directly. A rhombus neighborhood for SOM is proposed, and the combination of SOM and rough sets theory is explored. According to the distance between the weight of winner node and the input vector in the real rough sets space, new weight learning rules are defined. The modified method makes the classification of the output of SOM clearer and the intervals of different classes larger. Finally, an example based on fault identification of an aircraft actuator is presented, The result of the simulation shows that this method is right and effective.

Convergence Analysis of General Version of Gauss-Type Proximal Point Method for Metrically Regular Mappings

We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.