Approximations and Well-Posedness in Multicriteria Games

First, sufficient conditions of minimal character are given which guarantee the sequential closedness of the set-valued function defined by the parametric weak-multicriteria Nash equilibria of a parametric multicriteria game, that is to say: a convergent sequence of parametric weak-multicriteria Nash equilibria, corresponding to an approximate value of the parameter x_n, converges to a weak-multicriteria Nash equilibrium corresponding to the limit value x of the sequence (x_n)_n. Then, approximating sequences and parametrically well-posedness for a multicriteria game are introduced and investigated.     

On the Shadowing Property and Shadowable Point of Set-valued Dynamical Systems

In this article, the authors introduce the concept of shadowable points for set-valued dynamical systems, the pointwise version of the shadowing property, and prove that a set-valued dynamical system has the shadowing property iff every point in the phase space is shadowable; every chain transitive set-valued dynamical system has either the shadowing property or no shadowable points; and for a set-valued dynamical system there exists a shadowable point iff there exists a minimal shadowable point. In the end, it is proved that a set-valued dynamical system with the shadowing property is totally transitive iff it is mixing and iff it has the specification property.     

Stability of a Cubically Convergent Method for Generalized Equations

In Geoffroy et al, Acceleration of convergence in Dontchev's iterative method for solving variational inclusions Serdica Math. J. 29 (2003), pp. 45–54] we showed the convergence of a cubic method for solving generalized equations of the form 0 ∈ f(x) +- G(x) where f is a function and G stands for a set-valued map. We investigate here the stability of such a method with respect to some perturbations. More precisely, we consider the perturbed equation y ∈ f(x) +- G(x) and we show that the pseudo-Lipschitzness of the map (f +- G)⁻¹ is closely tied to the uniformity of our method in the sense that the attraction region does not depend on small perturbations of the parameter y. Finally, we provide an enhanced version of the convergence theorem established by Geoffroy, et al.     

An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets

Abstract

This paper contains a generalized Gordan-type alternative theorem for set-valued maps which characterizes set relations without any convexity assumptions using certain evaluation functions. As a direct consequence and as a good example, we discuss robustness (or stability) of linear programming problems for modelling error. Moreover, this theorem can be utilized for that of general vector optimization problems in special cases due to reformation of the evaluation functions.     

集值Vitali-Hahn-Saks-Nikodym定理

本文通过强可加集值测度的一个等价叙述引入集值测度一致强可加的概念,并建立了集值测度的Vitali-Hahn-Saks-Nikodym定理.     

集值变分包含的投影算法

A class of set-valued variational inclusions in Banach spaces and the convergence of the iterative algorithms are all studied in this paper.Moreover,the convergence and applications of projection algorithm to set-valued variational inclusions in Hilbert are also introduced.Many conclusions are generalized and improved.     

向量值测度产生的集值测度及性质

由有界变差向量值测度的值域,通过取凸包和闭包,构造了L[0,1],L2[0,1]和C[0,1]空间上的有界变差紧凸集值测度,结果由欧氏空间推广到函数空间.     

基于模糊集值映射的粗糙近似算子

给出基于模糊集值映射F的模糊集的下(上)近似等概念,研究F-下(上)近似算子aprF(aprF)的性质,探讨求它们的方法,得到若干结果.     

集值优化全局真有效解的最优性条件

本文引进集值映射的全局真有效次微分的概念,并用它得到了约束集值优化问题全局真有效解在集值映射的支撑函数和Lagrange乘子形式下的最优性必要条件.     

Levitin-poyak well-posedness of generalized vector equilibrium problems with functional constraints

In this article, we study Levitin-Polyak type well-posedness for generalized vector equilibrium problems with abstract and functional constraints. Criteria and characterizations for these types of well-posednesses are given.