Generalized Constraint Qualifications and Optimality Conditions for Set-Valued Optimization Problems

In this paper we discuss the connections of four generalized constraint qualifications for set-valued vector optimization problems with constraints. Then some K-T type necessary and sufficient optimality conditions are derived, in terms of the contingent epiderivatives.     

Second-Order Optimality Conditions for Set-Valued Vector Equilibrium Problems

In this article, by using the generalized second-order contingent (adjacent) epiderivatives of set-valued maps, we obtain necessary optimality conditions and sufficient optimality conditions for weakly efficient solutions, Henig efficient solutions to the set-valued vector equilibrium problems with constraints. Some results of this article improve the corresponding results in literatures by lessening the assumption of convexity.     

A chain rule for first- and second-order epiderivatives and hypoderivatives

A chain rule is established for contingent and adjacent epiderivatives and hypoderivatives of compositions g○h, where h is assumed to be Hadamard directionally differentiable. Corollaries include a formula for the contingent and adjacent cones of an equality constraint set defined by a Hadamard directionally differentiable function. An analogous chain rule for second-order contingent and adjacent epiderivatives and hypoderivatives is also developed.     

About contingent epiderivatives

In this paper we analyze some questions concerning the contingent epiderivative. When the ordering cone is not necessarily pointed we introduce the notion of family of contingent epiderivatives. We also investigate the relationship between the contingent derivative and the generalized epiderivative. Furthermore, we give existence theorems with respect to Daniell cones. As a particular case, we study set-valued maps that take values in Rn.     

Generalized Higher-Order Optimality Conditions for Set-Valued Optimization under Henig Efficiency

In this paper, generalized mth-order contingent epiderivative and generalized mth-order epiderivative of set-valued maps are introduced, respectively. By virtue of the generalized mth-order epiderivatives, generalized necessary and sufficient optimality conditions are obtained for Henig efficient solutions to a set-valued optimization problem whose constraint set is determined by a fixed set. Generalized Kuhn–Tucker type necessary and sufficient optimality conditions are also obtained for Henig efficient solutions to a set-valued optimization problem whose constraint set is determined by a set-valued map.     

Generalized second-order contingent epiderivatives in parametric vector optimization problems

This paper is concerned with generalized second-order contingent epiderivatives of frontier and solution maps in parametric vector optimization problems. Under some mild conditions, we obtain some formulas for computing generalized second-order contingent epiderivatives of frontier and solution maps, respectively. We also give some examples to illustrate the corresponding results.     

The existence of contingent epiderivatives for set-valued maps

This short note deals with the issue of existence of contingent epiderivatives for set-valued maps defined from a real normed space to the real line. A theorem of Jahn-Rauh [1], given for the existence of contingent epiderivatives, is used to obtain more general existence results. The strength and the limitations of the main result are discussed by means of some examples.     

集值映射多目标规划的K-T最优性条件

讨论集值映射多目标规划(VP)的最优性条件问题.首先,在没有锥凹的假设下,利用集值映射的相依导数,得到了(VP)的锥--超有效解要满足的必要条件和充分条件.其次,在锥凹假设和比推广了的Slater规格更弱的条件下,给出了(VP)关于锥--超有效解的K--T型最优性必要条件和充分条件.     

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.     

Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization

This study is devoted to constraint qualifications and Kuhn-Tucker type necessary optimality conditions for nonsmooth optimization problems involving locally Lipschitz functions. The main tool of the study is the concept of convexificators. First, the case of a minimization problem in the presence of an arbitrary set constraint is considered by using the contingent cone and the adjacent cone to the constraint set. Then, in the case of a minimization problem with inequality constraints, Abadie type constraint qualifications and several other qualifications are proposed; Kuhn-Tucker type necessary optimality conditions are derived under the qualifications.Communicated by S. SchaibleThe authors thank the referees for bringing to their attention some papers closely related to this study and for helpful comments and constructive suggestions that have greatly improved the original version of the paper. Further, they are indebted to Professors H. W. Sun and F. Y. Lu, who suggested an example for this paper. The first author thanks S. Schaible for encouragement during this research.     

Second-Order Modified Contingent Epiderivatives in Set-Valued Optimization

In this article, we introduce a second-order modified contingent cone and a second-order modified contingent epiderivative. We discuss some properties of the second-order cone and the epiderivative, respectively. Moreover, a Fritz John type necessary optimality condition is obtained for the set-valued optimization problems with constraints by using the second-order modified contingent epiderivative and an example is proposed to explain the Fritz John type necessary optimality condition. In particular, we obtain a unified second-order sufficient and necessary optimality condition for the set-valued optimization problems with constraints under twice differentiable L-quasi-convex assumption.     

Some Calculus Rules for Contingent Epiderivatives

This article presents some calculus rules for contingent epiderivatives of set-valued maps. Among other results the main emphasis is focused on a formula for scalar multiplication, sum formulae and chain rules. The calculus of contingent cones and some inversion theorems are used as a tool. Some applications are also given.     

Extended radial epiderivatives of non-convex vector-valued maps and parametric quasiconvex programming

In this paper, we consider extended vector-valued mappings defined on a normed linear space. Based on the recent semicontinuous regularizations related to hypographical and/or epigraphical profile mappings of the considered function introduced, we define semicontinuous radial epiderivatives. We, then, demonstrate that the properties of these epiderivatives amount to properties of hypographical and/or epigraphical profile mappings of the corresponding difference quotient of the underlying function, which simplify fairly well the proofs in the radial epiderivative formulaes. In particular, we stress the impact of semicontinuity, hence, we characterize with new arguments the radial epiderivatives in terms of the suprema and/or infima of the interiorly radial cone of the hypograph and/or epigraph of the considered function. Finally, we obtain optimality conditions for general non-convex constrained vector optimization problems. We apply thereafter the obtained pattern to a parametric quasiconvex programming problem for which we derive necessary and sufficient optimality conditions that are not sensitive to perturbation at the nominal level, yielding henceforth more – and strong at least under asymptotically regular constraints – information than the recent stability results obtained under additional conditions on the regularity of the normal cone to the adjusted sublevel sets of the underlying function.     

On optimality conditions for vector variational inequalities

Optimality conditions for weak efficient, global efficient and efficient solutions of vector variational inequalities with constraints defined by equality, cone and set constraints are derived. Under various constraint qualifications, necessary optimality conditions for weak efficient, global efficient and efficient solutions in terms of the Clarke and Michel–Penot subdifferentials are established. With assumptions on quasiconvexity of constraint functions sufficient optimality conditions are also given.     

Epidifferentiability of the map of infima in Hilbert spaces

This article deals with derivatives for set-valued maps that take values in ordered vector spaces, in particular it concerns about the relationship between the epiderivatives of a set-valued map and its associated map of infima. When the image space is a real separable Hilbert space ordered by an orthonormal basis, by using a variational technique based on a decoupling of the ordering cone into half-spaces, we show that both epiderivatives coincide under certain hypothesis of compactness and stability. Furthermore we obtain some computation formulas for these derivatives in terms of associated scalar set-valued maps.     

集值优化强有效解的广义二阶锥方向导数刻画

在实赋范线性空间中考虑集值优化问题的强有效性．借助Henig扩张锥和基泛函的性质,利用广义二阶锥方向相依导数,得到受约束于集值映射的优化问题,取得强有效元的二阶最优性必要条件．当目标函数为近似锥一次类凸映射时,利用强有效点的标量化定理,得到集值优化问题,取得强有效元的二阶充分条件．     

Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives

In this paper necessary and sufficient conditions for strict minimizers of a general vector optimization problem are given by means of different notions of graphical or epigraphical derivatives, extending some existing results in the literature. In first place, these conditions are established by means of contingent derivatives and secondly, by applying a nonconvex separation result, in terms of contingent epiderivatives and hypoderivatives. Moreover, through a variational approach, a scalarization method is developed in order to obtain scalar versions of these results.     

Variational characterization of the contingent epiderivative

In this paper the existence of the contingent epiderivative of a set-valued map is studied from a variational perspective. We give a variational characterization of the ideal minimal of a weakly compact set. As a consequence we characterize the existence of the contingent epiderivative in terms of an associated family of variational systems. When a set-valued map takes values in Rn we show that these systems can be formulated in terms of the contingent epiderivatives of scalar set-valued maps. By applying these results we extend some existing theorems.     

The role of directional compactness in the existence and computation of contingent epiderivatives

This paper underlines the role of directional compactness in the scalarization of graphical derivatives of set-valued maps taking values in infinite-dimensional spaces. Two main theorems are given. The first one states the equivalence of contingent epiderivatives and τw-contingent epiderivatives for directionally compact maps. The second main result proves a variational characterization for the contingent epiderivative of stable and directionally compact maps taking values in general image spaces, extending known results in finite-dimensional and reflexive Banach spaces. The hypotheses given are minimal as is shown by means of several examples. Connections of these theorems with other results of the literature are also provided.     

A spline smoothing homotopy method for nonconvex nonlinear programming

Homotopy methods are globally convergent under weak conditions and robust; however, the efficiency of a homotopy method is closely related with the construction of the homotopy map and the path tracing algorithm. Different homotopies may behave very different in performance even though they are all theoretically convergent. In this paper, a spline smoothing homotopy method for nonconvex nonlinear programming is developed using cubic spline to smooth the max function of the constraints of nonlinear programming. Some properties of spline smoothing function are discussed and the global convergence of spline smoothing homotopy under the weak normal cone condition is proven. The spline smoothing technique uses a smooth constraint instead of m constraints and acts also as an active set technique. So the spline smoothing homotopy method is more efficient than previous homotopy methods like combined homotopy interior point method, aggregate constraint homotopy method and other probability one homotopy methods. Numerical tests with the comparisons to some other methods show that the new method is very efficient for nonlinear programming with large number of complicated constraints.