Pointwise Well-Posedness of Perturbed Vector Optimization Problems in a Vector-Valued Variational Principle

In this note, we point out and correct some errors in Ref. 1. Another type of pointwise well-posedness and strong pointwise well-posedness of vector optimization problems is introduced. Sufficient conditions to guarantee this type of well-posedness are provided for perturbed vector optimization problems in connection with the vector-valued Ekeland variational principle.     

Extended Well-Posedness of Quasiconvex Vector Optimization Problems

The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. Research partially supported by the Cariplo Foundation, Grant 2006.1601/11.0556, Cattaneo University, Castellanza, Italy.     

向量值优化问题的适定性

将向量值优化问题的适定性理论推广到具有W-距离的拟度量空间中,给出B-适定性及DH-适定性的概念,并得到相应的判别准则．定义一类非线性标量化函数,利用这类标量化函数的性质将向量值优化问题转化为标量值优化问题,得到原问题与标量化问题的适定性之间的等价关系．     

Well Posedness in Vector Optimization Problems and Vector Variational Inequalities

In this paper, we give notions of well posedness for a vector optimization problem and a vector variational inequality of the differential type. First, the basic properties of well-posed vector optimization problems are studied and the case of C-quasiconvex problems is explored. Further, we investigate the links between the well posedness of a vector optimization problem and of a vector variational inequality. We show that, under the convexity of the objective function f, the two notions coincide. These results extend properties which are well known in scalar optimization. Communicated by F. Giannessi     

Extended well-posedness of optimization problems

The well-posedness concept introduced in Ref. 1 for global optimization problems with a unique solution is generalized here to problems with many minimizers, under the name of extended well-posedness. It is shown that this new property can be characterized by metric criteria, which parallel to some extent those known about generalized Tikhonov well-posedness.This work was partially supported by MURST, Fondi 40%, Rome, Italy.     

Vector Variational Inequality and Vector Pseudolinear Optimization

The study of a vector variational inequality has been advanced because it has many applications in vector optimization problems and vector equilibrium flows. In this paper, we discuss relations between a solution of a vector variational inequality and a Pareto solution or a properly efficient solution of a vector optimization problem. We show that a vector variational inequality is a necessary and sufficient optimality condition for an efficient solution of the vector pseudolinear optimization problem.     

Approximate Efficiency and Scalar Stationarity in Unbounded Nonsmooth Convex Vector Optimization Problems

We deal with extended-valued nonsmooth convex vector optimization problems in infinite-dimensional spaces where the solution set (the weakly efficient set) may be empty. We characterize the class of convex vector functions having the property that every scalarly stationary sequence is a weakly-efficient sequence. We generalize the results obained in the scalar case by Auslender and Crouzeix about asymptotically well-behaved convex functions and improve substantially the few results known in the vector case.     

Vector Variational Inequalities for Nondifferentiable Convex Vector Optimization Problems

In this paper, we consider a nondifferentiable convex vector optimization problem (VP), and formulate several kinds of vector variational inequalities with subdifferentials. Here we examine relations among solution sets of such vector variational inequalities and (VP). Mathematics Subject classification (2000). 90C25, 90C29, 65K10 This work was supported by the Brain Korea 21Project in 2003. The authors wish to express their appreciation to the anonymous referee for giving valuable comments.     

On Relations Between Vector Optimization Problems and Vector Variational Inequalities

We obtain equivalences between weak Pareto solutions of vector optimization problems and solutions of vector variational inequalities involving generalized directional derivatives.     

Some Remarks On Vector Optimization Problems

We prove the existence of a weak minimum for vector optimization problems by means of a vector variational-like inequality and preinvex mappings.     

Well-Posedness and Scalarization in Vector Optimization

In this paper, we study several existing notions of well- posedness for vector optimization problems. We separate them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are well posed.The authors thank Professor C. Zălinescu for pointing out some inaccuracies in Ref. 11. His remarks allowed the authors to improve the present work.     

Scalarization and Stability in Vector Optimization

A class of scalarizations of vector optimization problems is studied in order to characterize weakly efficient, efficient, and properly efficient points of a nonconvex vector problem. A parallelism is established between the different solutions of the scalarized problem and the various efficient frontiers. In particular, properly efficient points correspond to stable solutions with respect to suitable perturbations of the feasible set.     

关于集值目标映射的向量平衡问题的广义Tykhonov适定性

引入集值目标映射的向量平衡问题的两类广义Tykhonov适定性,利用非紧性Kuratowski测度给出它们的度量刻划和讨论这两类适定性的充分性条件.最后证明向量平衡问题的广义Tykhonov适定性与约束极小化问题的广义Tykhonov适定性之间的等价关系.     

广义强向量拟平衡问题解的存在性和Hadamard适定性

首先,在映射－f(·,y,u)自然拟C-凸和映射f上半(－C)-连续的条件下,构造一个重要辅助函数,利用不同的证明方法,在不要求C*具有弱*紧基的情况下,建立了广义强向量拟平衡问题解的存在性定理.然后在适当条件下,给出问题序列收敛的定义,建立解集映射的上半连续性,并讨论广义强向量拟平衡问题的Hadamard适定性,得到广义强向量拟平衡问题的Hadamard适定性成立的充分条件.     

优化和均衡的等价性

通过向量优化问题, 向量变分不等式问题以及向量变分原理来分析优化问题及均衡问题的一致性.从而显然, 可以用统一的观点来处理数值优化、向量优化以及博弈论等问题.进而为非线性分析提供了一个新的发展空间.     

伪单调型向量F-互补问题可行集的最小元问题

本文引入了几类向量F-互补问题并给出了向量F-互补问题与广义向量变分不等式之间的关系.通过定义向量F-互补问题的可行集,研究了伪单调型向量F-互补问题的可行集的最小问题,推广了已有的一些结果.     

Vector Equilibrium Problems Under Asymptotic Analysis

Given a closed convex set K in Rⁿ; a vector function F:K×K R^m; a closed convex (not necessarily pointed) cone P(x) in ^m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=^m ₊ is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.     

集优化问题的广义适定性与解的稳定性

本文研究了集优化问题的适定性与解的稳定性. 首次利用嵌入技术引入了集优化问题的广义适定性概念, 得到了此类适定性的一些判定准则和特征, 并给出其充分条件. 此外, 借助一类广义Gerstewitz 函数, 建立了此类适定性与一类标量优化问题广义适定性之间的等价关系. 最后, 在适当条件下研究了含参集优化问题弱有效解映射的上半连续性和下半连续性.     

Vector optimization problems with nonconvex preferences

In this paper, some vector optimization problems are considered where pseudo-ordering relations are determined by nonconvex cones in Banach spaces. We give some characterizations of solution sets for vector complementarity problems and vector variational inequalities. When the nonconvex cone is the union of some convex cones, it is shown that the solution set of these problems is either an intersection or an union of the solution sets of all subproblems corresponding to each of these convex cones depending on whether these problems are defined by the nonconvex cone itself or its complement. Moreover, some relations of vector complementarity problems, vector variational inequalities, and minimal element problems are also given. While this paper was being revised in September 2006, Professor Alex Rubinov (the second author of the paper) left us due to the illness. This is a very sad news to us. We dedicate this paper to the memory of Professor Rubinov as a mathematician and truly friend.