群体多目标决策联合有效解类的不变凸充分条件

对于群体多目标决策问题，文[1]引进它的联合有效解类的概念，并给出这类解的最优性必要条件，在对于问题的目标函数和约束函数附加凸性的条件下，文[2]又给出了联合有效解类的最优性充分条件，本文进一步在目标函数和约束函数具不变凸和不变广义 凸的情况下，分别给出了联合有效解类的若干最优性充分条件。     

ON SUFFICIENCY AND DUALITY OF SOLUTIONS FOR QUASI Bs-INVEX SEMI-INFINITE PROGRAMMING

1　IntroductionRecently,various kinds of generalized convex functions were introduced.Bector andSingh[1 ] introduced a class of functions which called B-vex function.Bector,Suneja,andLalitha[2 ] introduced quasi B-vex function,pseudo B-vex function,B-invex function,quasi B-invex function,and pseudo B-invex function.We[3] extended invex function[4] ,gave thedefinitions of the symmetricη-function,symmetricη-pseudoconvex function,symmetricη-quasiconvex function for symmetric differentiable…     

半严格不变凸函数

文章在Banach空间中定义了一种新的广义凸函数—半严格不变凸函数.对于满足局部Lipschitz条件的半严格不变凸函数,得到了它的广义Clarke次微分性质.文中还讨论了半严格不变凸函数与不变凸函数及半严格预不变凸函数之间的关系,得到了半严格不变凸函数的一些性质.     

半严格不变凸函数

文章在Banach空间中定义了一种新的广义凸函数—半严格不变凸函数.对于满足局部Lipschitz条件的半严格不变凸函数,得到了它的广义Clarke次微分性质.文中还讨论了半严格不变凸函数与不变凸函数及半严格预不变凸函数之间的关系,得到了半严格不变凸函数的一些性质.     

广义不变凸多目标半无限规划的鞍点条件

利用广义代数运算,定义了一类不变凸函数和不完全向量值Lagrange函数的鞍点,研究了涉及此类函数的多目标半无限规划问题,得到了广义鞍点的必要性和充分性条件.在更弱的凸性条件下,得到了几个重要结果.     

Invex sets and preinvex functions on Riemannian manifolds

The concept of a geodesic invex subset of a Riemannian manifold is introduced. Geodesic invex and preinvex functions on a geodesic invex set with respect to particular maps are defined. The relation between geodesic invexity and preinvexity of functions on manifolds is studied. Using proximal subdifferential, certain results concerning extremum points of a non smooth geodesic preinvex function on a geodesic invex set are obtained. The main value inequality and the mean value theorem in invexity analysis are extended to Cartan-Hadamard manifolds.     

Second-order invex functions in nonlinear programming

We introduce a notion of a second-order invex function. A Fréchet differentiable invex function without any further assumptions is second-order invex. It is shown that the inverse claim does not hold. A Fréchet differentiable function is second-order invex if and only if each second-order stationary point is a global minimizer. Two complete characterizations of these functions are derived. It is proved that a quasiconvex function is second-order invex if and only if it is second-order pseudoconvex. Further, we study the nonlinear programming problem with inequality constraints whose objective function is second-order invex. We introduce a notion of second-order type I objective and constraint functions. This class of problems strictly includes the type I invex ones. Then we extend a lot of sufficient optimality conditions with generalized convex functions to problems with second-order type I invex objective function and constraints. Additional optimality results, which concern type I and second-order type I invex data are obtained. An answer to the question when a kernel, which is not identically equal to zero, exists is given.     

Some characterizations of strongly preinvex functions

In this paper, a new class of generalized convex function is introduced, which is called the strongly α-preinvex function. We study some properties of strongly α-preinvex function. In particular, we establish the equivalence among the strongly α-preinvex functions, strongly α-invex functions and strongly αη-monotonicity under some suitable conditions. As special cases, one can obtain several new and previously known results for α-preinvex (invex) functions.     

参数非线性规划中最优值函数的预不变凸凹性

本文给出了预拟不变单调函数的定义,提出了不变凸点到集映射、不变凹点到集映射的新概念,得到了不变凸点到集映射的一个充分必要条件,研究了参数非线性规划中最优值函数的预不变凸凹性。     

Optimality conditions for an isolated minimum of order two in C constrained optimization

In this paper we obtain first and second-order optimality conditions for an isolated minimum of order two for the problem with inequality constraints and a set constraint. First-order sufficient conditions are derived in terms of generalized convex functions. In the necessary conditions we suppose that the data are continuously differentiable. A notion of strongly KT invex inequality constrained problem is introduced. It is shown that each Kuhn-Tucker point is an isolated global minimizer of order two if and only if the problem is strongly KT invex. The article could be considered as a continuation of [I. Ginchev, V.I. Ivanov, Second-order optimality conditions for problems with C¹ data, J. Math. Anal. Appl. 340 (2008) 646-657].     

关于非光滑不变凸多目标规划的Wolfe型对偶

本文讨论定义在Banach空间上的,既具有等式约束又具有不等式约束的,非光滑(F,P)不变凸多目标规划的Wolfe对偶性,Mond-Weir型对偶性可类似讨论之。     

Note on generalized convex functions

In this note, an important class of generalized convex functions, called invex functions, is defined under a general framework, and some properties of the functions in this class are derived. It is also shown that a function is (generalized) pseudoconvex if and only if it is quasiconvex and invex.     

Generalized Invariant Monotonicity and Invexity of Non-differentiable Functions

This paper is devoted to the study of relationships between several kinds of generalized invexity of locally Lipschitz functions and generalized monotonicity of corresponding Clarke’s subdifferentials. In particular, some necessary and sufficient conditions of being a locally Lipschitz function invex, quasiinvex or pseudoinvex are given in terms of momotonicity, quasimonotonicity and pseudomonotonicity of its Clarke’s subdifferential, respectively. As an application of our results, the existence of the solutions of the variational-like inequality problems as well as the mathematical programming problems (MP) is given. Our results extend and unify the well known earlier works of many authors.     

Optimality criteria and duality in multiple-objective optimization involving generalized invexity

A multiple-objective optimization problem involving generalized invex functions is considered. Kuhn-Tucker type necessary and sufficient conditions are obtained for a feasible point to be an efficient or properly efficient solution. Two dual programs are obtained. The results are given under weaker invexity assumptions.     

On nondifferentiable minimax fractional programming under generalized α-type I invexity

In this paper, we study a nondifferentiable minimax fractional programming problem under the assumptions of generalized α-type I invex function. In this paper we introduce the concepts of α-type I invex, pseudo α-type I invex, strict pseudo α-type I invex and quasi α-type I invex functions in the setting of Clarke subdifferential functions. We derive Karush-Kuhn-Tucker type sufficient optimality conditions and establish weak, strong and converse duality theorems for the problem and its three different dual problems. The results in this paper extend several known results in the literature.     

The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function

In this paper, we study the Karush–Kuhn–Tucker optimality conditions in a class of nonconvex optimization problems with an interval-valued objective function. Firstly, the concepts of preinvexity and invexity are extended to interval-valued functions. Secondly, several properties of interval-valued preinvex and invex functions are investigated. Thirdly, the KKT optimality conditions are derived for LU-preinvex and invex optimization problems with an interval-valued objective function under the conditions of weakly continuous differentiablity and Hukuhara differentiablity. Finally, the relationships between a class of variational-like inequalities and the interval-valued optimization problems are established.     

Invex equilibrium problems

In this paper, we introduce a new class of equilibrium problems, known as invex equilibrium problems in the setting of invexity. This class of equilibrium problems includes equilibrium problems, variational inequalities and variational-like inequalities as special cases. We use the auxiliary principle technique to suggest and analyze some iterative schemes for solving invex equilibrium problems and study the convergence criteria of these methods under some mild conditions. We also consider the concept of well-posedness for invex equilibrium problems. Our results represent significant and important refinements of the previously known results.     

Generalized Invex Monotonicity and Its Role in Solving Variational-Like Inequalities

The paper stresses the role of new classes of generalized invex monotonicity in the convergence of iterative schemes for solving a variational-like inequality problem on a closed convex set. This work was supported by Grant NSFC 70432001.     

On equilibrium-like problems

In this article we introduce a new class of equilibrium problems known as mixed quasi invex equilibrium (equilibrium-like) problems with trifunction. This class of equilibrium problems includes invex equilibrium problems, variational inequalities and variational-like inequalities as special cases. We use the auxiliary principle technique to suggest and analyze some iterative schemes for solving invex equilibrium problems and study the convergence criteria of these methods under mild conditions. Our results represent significant and important refinements of the previously known results.