Optimality Conditions for C1,1 Vector Optimization Problems

The main purpose of this paper is to make use of the second-order subdifferential of vector functions to establish necessary and sufficient optimality conditions for vector optimization problems.     

On Monotonicity of First and Second-order Differential Quotients

First and second-order epigraphical derivatives, obtained as epigraphical limits of first and second-order differential quotients, are quite difficult to compute in practice. The aim of this note is to explore the case in which these differential quotients have a certain monotonic behavior. The functions under consideration may be nonsmooth and/or nonconvex.     

广义凸函数的特征性质

提出广义凸集、广义凸函数、中间点广义凸函数、端点广义凸函数四个定义,通过定义条件P1,研究条件P1所蕴含的等式关系,进而得到一个基础性定理一稠密性定理和一个相对条件较弱的推论,最后将结果应用于若干不同类型的广义凸函数类,尤其是s-凸函数、几何凸函数、rp-凸函数,得到它们所共有的一个特征性质,即满足稠密性定理．     

严有效点与Henig真有效点

文章证明了严有效点等价于Henig真有效点．利用这个等价关系，得到了局部凸空间中Henig真有效点的存在性条件。纯量化特征和稠密性定理．并且改进了已知的有关结果．     

Optimality for set functions with values in ordered vector spaces

Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() _D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

Generalized Convexity of Functions and Generalized Monotonicity of Set-Valued Maps

We establish connections between some concepts of generalized monotonicity for set-valued maps introduced earlier and some notions of generalized convexity. Moreover, a notion of pseudomonotonicity for set-valued maps is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar.     

Applications of extreme points to distortion estimates

The main object of this paper is to introduce and investigate a class of analytic functions with negative coefficients defined by the Wright generalized hypergeometric function. By using the extreme points theory we obtain coefficient estimates and distortion theorems in the class of functions.     

序线性空间中向量优化问题的K-T型定理

本文在广义凸性条件下,研究实线性空间中一类向量优化问题的最优性条件,我们引入F ritz-John鞍点,、“K-T鞍点”讨论它们与有效解、弱有效解之间的关系.     

Derivatives of generalized farthest functions and existence of generalized farthest points

The relationship between directional derivatives of generalized farthest functions and the existence of generalized farthest points in Banach spaces is investigated. It is proved that the generalized farthest function generated by a bounded closed set having a one-sided directional derivative equal to 1 or −1 implies the existence of generalized farthest points. New characterization theorems of (compact) locally uniformly convex sets are given.     

Increasing Convex-Along-Rays Functions with Applications to Global Optimization

Increasing convex-along-rays functions are defined within an abstract convexity framework. The basic properties of these functions including support sets and subdifferentials are outlined. Applications are provided to unconstrained global optimization using the concept of excess function.     

Seven kinds of monotone maps

Known as well as new types of monotone and generalized monotone maps are considered. For gradient maps, these generalized monotonicity properties can be related to generalized convexity properties of the underlying function. In this way, pure first-order characterizations of various types of generalized convex functions are obtained.     

Generalized Monotonicity of Subdifferentials and Generalized Convexity

Characterizations of convexity and quasiconvexity of lower semicontinuous functions on a Banach space X are presented in terms of the contingent and Fréchet subdifferentials. They rely on a general mean-value theorem for such subdifferentials, which is valid in a class of spaces which contains the class of Asplund spaces.     

On Order-Preserving Properties of Probability Metrics

Stochastic orders and probability metrics are two areas that have received considerable attention in recent literature. A question of interest on its own and for certain applications is the preservation of metrics with respect to orders. This property does not seem to have been examined explicitly so far. Our purpose in this paper is to provide some useful remarks and results related to several orders and metrics which are standard in probability.     

The q-asymptotic function in c-convex analysis

Abstract

We establish several connections between generalized asymptotic functions and different areas of convexity theory, without coercivity assumptions. Properties and characterizations of abstract subdifferentials, normal cones, conjugates, support functions and optimality conditions for the minimization problem are given. We provide a new result on existence of minimizers for a class of nonconvex functions which is strictly larger than the class of quasiconvex ones.     

E-Convex Sets, E-Convex Functions, and E-Convex Programming

A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.     

On generalized weak subdifferentials and some properties

In this article, some characterizations for gw-subdifferentiability of functions from ? ⁿ to ? ^m are stated. Some criteria for gw-subdifferentiability of generalized lower locally Lipschitz functions and positively homogeneous functions are given. Furthermore, it is proved that every Lipschitz function is gw-subdifferentiable at any point in its domain. Finally, the relationship between directional derivative and gw-subdifferential is given and a convexity criteria for Fréchet differentiable function is given by using gw-subdifferential.     

On the Monoid of All Partial Order-Preserving Extensive Transformations

A partial transformation α on an n-element chain X _n is called order-preserving if x ≤ y implies xα ≤yα for all x, y in the domain of α and it is called extensive if x ≤ xα for all x in the domain of α. The set of all partial order-preserving extensive transformations on X _n forms a semiband POE _n . We determine the maximal subsemigroups as well as the maximal subsemibands of POE _n .     

Weighting factor results in vector optimization

This paper deals with the study, in a convex vector optimization problem, of the set of efficient solutions and the set of properly efficient solutions, the latter being obtained by a weighting factor technique. Relationships between these two sets are discussed; they are shown to be nonempty when the objective functions have no common direction of recession and to be closed and equal when, moreover, the objective functions are locally polyhedral. An example is provided where the set of efficient solutions is not included in the closure of the nonempty set of properly efficient solutions.The author wishes to thank the unknown referee for the helpful comments that improved the quality of this paper.     

Asymptotic Results for Semigroups of Order-Preserving Partial Transformations

Let 𝒫  _n be the semigroup of all decreasing and order-preserving partial transformations of an n-element chain, and let E(𝒫  _n ) be its set of idempotents. Among other results, asymptotic formulae for |𝒫  _n | and |E(𝒫  _n )|/|𝒫  _n | are obtained. Similar results for 𝒫  _n the (larger) semigroup of all order-preserving partial transformations of an n-element chain are also obtained.