Henig proper efficient points and generalized Henig proper efficient points

Applying the theory of locally convex spaces to vector optimization, we investigate the relationship between Henig proper efficient points and generalized Henig proper efficient points. In particular, we obtain a sufficient and necessary condition for generalized Henig proper efficient points to be Henig proper efficient points. From this, we derive several convenient criteria for judging Henig proper efficient points.     

Well-posedness and stability in vector optimization problems using Henig proper efficiency

In this article, we study well-posedness and stability aspects for vector optimization in terms of minimizing sequences defined using the notion of Henig proper efficiency. We justify the importance of set convergence in the study of well-posedness of vector problems by establishing characterization of well-posedness in terms of upper Hausdorff convergence of a minimizing sequence of sets to the set of Henig proper efficient solutions. Under certain compactness assumptions, a convex vector optimization problem is shown to be well-posed. Finally, the stability of vector optimization is discussed by considering a perturbed problem with the objective function being continuous. By assuming the upper semicontinuity of certain set-valued maps associated with the perturbed problem, we establish the upper semicontinuity of the solution map.     

The Ekeland variational principle for Henig proper minimizers and super minimizers

In this paper we consider, for the first time, approximate Henig proper minimizers and approximate super minimizers of a set-valued map F with values in a partially ordered vector space and formulate two versions of the Ekeland variational principle for these points involving coderivatives in the sense of Ioffe, Clarke and Mordukhovich. As applications we obtain sufficient conditions for F to have a Henig proper minimizer or a super minimizer under the Palais-Smale type conditions. The techniques are essentially based on the characterizations of Henig proper efficient points and super efficient points by mean of the Henig dilating cones and the Hiriart-Urruty signed distance function.     

集值优化问题在Henig真有效解意义下的导数型最优性条件

给出实的赋范空间中集值映射的Henig真有效解集的一些性质,并利用集值映射的相依上图导数和集值映射的次微分给出了集值优化问题Henig真有效解的最优性条件的充要条件.     

On the notion of proper efficiency in vector optimization

In this paper, we consider the main definitions of proper efficiency for a vector optimization problem in topological linear spaces. The implications among these definitions generalize the inclusion structure holding in Euclidean spaces with componentwise ordering.     

Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior

In this paper, we consider the set-valued vector optimization problems with constraint in locally convex spaces. We present the necessary and sufficient conditions for Henig efficient solution pair, globally proper efficient solution pair and super efficient solution pair without the ordering cones having the nonempty interior.     

Unified Representation of Proper Efficiency by Means of Dilating Cones

We reduce the definitions of proper efficiency due to Hartley, Henig, Borwein, and Zhuang to a unified form based on the notion of a dilating cone, i.e., an open cone containing the ordering cone. This new form enables us to obtain a comprehensive comparison among these and other kinds of proper efficiency. The most advanced results are obtained for a special class of proper efficiencies corresponding to one-parameter families of uniform dilations. This class is sufficiently wide and includes, for example, the Hartley and Henig proper efficiencies as well as superefficiency.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Henig Efficiency in Vector Optimization with Nearly Cone-subconvexlike Set-valued Functions

In this paper,we study Henig efficiency in vector optimization with nearly cone-subconvexlikeset-valued function.The existence of Henig efficient point is proved and characterization of Henig efficiencyis established using the method of Lagrangian multiplier.As an interesting application of the results in thispaper,we establish a Lagrange multiplier theorem for super efficiency in vector optimization with nearly cone-subconvexlike set-valued function.     

内部锥-凸集值映射Henig有效性的Morea-Rockafellar定理

本文利用集值映射弱次梯度的Morea-Rockafellar定理,在内部(锥)-凸性假设下,得到了集值映射关于Henig有效性的Morea-Rockafellar定理.其结论为:在内部(锥)-凸条件下,两个集值映射和的Henig有效次梯度可以表示成它们Henig有效次梯度的和.     

Density of the set of positive proper minimal points in the set of minimal points

One of the important problems of vector optimization concerns the density of the set of positive proper minimal points in the set of minimal points. We use the concepts of dentable point and approximating cones to derive sufficient conditions guaranteeing that the set of minimal points is contained in the closure of the set of positive proper minimal points. The result can be applied to obtain a density result for the unit ball in 1 ^p , 1<p<+, which does not follow from any other well-known density theorem.The author would like to thank Professor W. T. Fu for helpful comments. Moreover, the author is grateful to Professor H. P. Benson and the referees for valuable remarks and suggestions concerning a previous draft of this paper.     

A generalization of a theorem of Arrow,Barankin and Blackwell to a nonconvex case

The paper presents a generalization of a known density theorem of Arrow, Barankin, and Blackwell for properly efficient points defined as support points of sets with respect to monotonically increasing sublinear functions. This result is shown to hold for nonconvex sets of a partially ordered reflexive Banach space.     

生成锥内部凸-锥-类凸集值优化问题的Henig真有效性

该文讨论局部凸空间中的约束集值优化问题. 首先, 在生成锥内部凸-锥-类凸假设下, 建立了Henig真有效解在标量化和Lagrange乘子意义下的最优性条件. 其次, 对集值Lagrange映射引入Henig真鞍点的概念, 并用这一概念刻画了Henig真有效解. 最后, 引入了一个标量Lagrange对偶模型, 并得到了关于Henig真有效解的对偶定理. 另外, 该文所得结果均不需要约束序锥有非空的内部.     

Efficiency and Henig Efficiency for Vector Equilibrium Problems

We introduce the concept of Henig efficiency for vector equilibrium problems, and extend scalarization results from vector optimization problems to vector equilibrium problems. Using these scalarization results, we discuss the existence of the efficient solutions and the connectedness of the set of Henig efficient solutions to the vector-valued Hartman–Stampacchia variational inequality.     

Value functions,domination cones and proper efficiency in multicriteria optimization

In the absence of a clear objective value function, it is still possible in many cases to construct a domination cone according to which efficient (nondominated) solutions can be found. The relations between value functions and domination cones and between efficiency and optimality are analyzed here. We show that such cones must be convex, strictly supported and, frequently, closed as well. Furthermore, in most applications potential optimal solutions are equivalent to properly efficient points. These solutions can often be produced by maximizing with respect to a class of concave functions or, under convexity conditions, a class of affine functions.     

几乎锥-次类凸向量集值优化的Benson真有效性

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ [1 ],Ｙａｎｇ ,ＬｉａｎｄＷａｎｇｉｎｔｒｏｄｕｃｅｄａｎｅｗｃｌａｓｓｏｆｇｅｎｅｒａｌｉｚｅｄｃｏｎｖｅｘｓｅｔ ｖａｌｕｅｄｆｕｎｃ ｔｉｏｎｓ,ｔｅｒｍｅｄｎｅａｒｌｙｃｏｎｅ ｓｕｂｃｏｎｖｅｘｌｉｋｅｆｕｎｃｔｉｏｎｓ.Ｉｎ [2 ],ＣｈｅｎａｎｄＲｏｎｇｓｔｕｄｉｅｄＢｅｎｓｏｎｐｒｏｐｅｒｅｆｆｉｃｉｅｎｃｙｉｎｖｅｃｔｏｒｏｐｔｉｍｉｚａｔｉｏｎｗｉｔｈｇｅｎｅｒａｌｉｚｅｄｃｏｎｅ ｓｕｂｃｏｎｖｅｘｌｉｋｅｖｅｃｔｏｒ ｖａｌｕｅｄｆｕｎｃ ｔｉｏｎｓ…     

Higher order optimality conditions for Henig efficient solutions in set-valued optimization

In this paper, higher order generalized contingent epiderivative and higher order generalized adjacent epiderivative of set-valued maps are introduced. Necessary and sufficient conditions for Henig efficient solutions to a constrained set-valued optimization problem are given by employing the higher order generalized epiderivatives.     

Bases of convex cones and Borwein's proper efficiency

In this note, we establish some interesting relationships between the existence of Borwein's proper efficient points and the existence of bases for convex ordering cones in normed linear spaces. We show that, if the closed unit ball in a smooth normed space ordered by a convex cone possesses a proper efficient point in the sense of Borwein, then the ordering cone is based. In particular, a convex ordering cone in a reflexive space is based if the closed unit ball possesses a proper efficient point. Conversely, we show that, in any ordered normed space, if the ordering cone has a base, then every weakly compact set possesses a proper efficient point.The research was conducted while the author was working on his PhD Degree under the supervision of Professor J. M. Borwein, whose guidance and valuable suggestions are gratefully appreciated. The author would like to thank two anonymous referees for their constructive comments and suggestions. This research was supported by an NSERC grant and a Mount Saint Vincent University Research Grant.     

A proper generalized decomposition approach for optical flow estimation

This paper introduces the use of the proper generalized decomposition (PGD) method for the optical flow (OF) problem in a classical framework of Sobolev spaces, ie, optical flow methods including a robust energy for the data fidelity term together with a quadratic penalizer for the regularization term. A mathematical study of PGD methods is first presented for general regularization problems in the framework of (Hilbert) Sobolev spaces, and their convergence is then illustrated on OF computation. The convergence study is divided in two parts: (a) the weak convergence based on the Brézis-Lieb decomposition and (b) the strong convergence based on a growth result on the sequence of descent directions. A practical PGD-based OF implementation is then proposed and evaluated on freely available OF data sets. The proposed PGD-based OF approach outperforms the corresponding non-PGD implementation in terms of both accuracy and computation time for images containing a weak level of information, namely, low image resolution and/or low signal-to-noise ratio (SNR).