Set-valued Vector Research Articles

Stability Analysis of Hybrid Automata with Set-Valued Vector Fields Using Sums of Squares

Stability analysis is one of the most important problems in analysis of hybrid dynamical systems. In this paper, a computational method of Lyapunov functions is proposed for stability analysis of hybrid automata that have set-valued vector fields. For this purpose, a formulation of matrix-valued sums of squares is provided and applied to derive an LMI/LME problem whose solution yields a Lyapunov function.

On flow switching bifurcations in discontinuous dynamical systems

In paper, the sliding dynamics on the separation boundary is discussed based on the set-valued vector field theory. From vector fields in the neighborhood of a specific separation boundary, the passability of the flow from the one domain into another one is further discussed. The switching bifurcation conditions from the passable boundary to the non-passable boundary are developed. The sliding flow fragmentation on the separation boundary surface is also presented. The normal vector product field function is introduced to determine the switching bifurcation and sliding fragmentation.

A Scalarization Approach for Vector Variational Inequalities with Applications

We consider an approach to convert vector variational inequalities into an equivalent scalar variational inequality problem with a set-valued cost mapping. Being based on this property, we give an equivalence result between weak and strong solutions of set-valued vector variational inequalities and suggest a new gap function for vector variational inequalities. Additional examples of applications in vector optimization, vector network equilibrium and vector migration equilibrium problems are also given

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.

Weak Subdifferential of Set-Valued Mappings

In this note we introduce a notion of the weak contingent generalized gradient for set-valued mappings associated with the contingent epiderivative of set-valued mappings introduced in "E. Bednarczuk and W. Song (1998). Contingent epiderivative and its applications to set-valued optimization. Control and Cybernetics, 27, 376-386; G.Y. Chen and J. Jahn (1998). Optimally conditions for set-valued optimization problems. Mathematical Methods of Operations Research, 48, 187-200." and prove that, under some additional condition, it coincides with the weak subdifferential introduced in "T. Tanino (1992). Conjugate duality in vector optimization. Journal of Mathematical Analysis and Applications, 167, 84-97." when the set-valued map is cone-convex. We also study the weak contingent generalized gradient of a sum of two set-valued mappings and optimality conditions for a set-valued vector optimization problem.

Gap Functions and Existence of Solutions to Set-Valued Vector Variational Inequalities

The variational inequality problem with set-valued mappings is very useful in economics and nonsmooth optimization. In this paper, we study the existence of solutions and the formulation of solution methods for vector variational inequalities (VVI) with set-valued mappings. We introduce gap functions and establish necessary and sufficient conditions for the existence of a solution of the VVI. It is shown that the optimization problem formulated by using gap functions can be transformed into a semi-infinite programming problem. We investigate also the existence of a solution for the generalized VVI with a set-valued mapping by virtue of the existence of a solution of the VVI with a single-valued function and a continuous selection theorem.

Optimality conditions for vector optimisation with set-valued maps

In this paper, we establish a Farkas-Minkowski type alternative theorem under the assumption of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we establish necessary optimality conditions for set-valued vector optimisation problems with extended inequality constraints in a sense of weak E-minimisers.

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.

The optimality conditions of nonconvex Set-valued vector optimization

The concepts of α-order Clarke’s derivative, α-order Adjacent derivative and α-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

Proper efficiency for set-valued vector optimization problems and vector variational inequalitiesRID="*"ID="*"  This research was partially supported by the National Natural Science Foundation of P.R. China and the Natural Science Foundation of Jiangxi Province, P.R. China.

We obtain the necessary and sufficient conditions of many kinds of proper efficiency in vector set-valued optimization by using the concept of contingent epiderivative introduced by Jahn and Rauh, also we disclose the closed relations between proper efficiency of vector set-valued optimization problem and proper efficiency of a certain kind of vector variational inequality.

Periodic Solutions for Second Order Differential Inclusions with Nonconvex and Unbounded Multifunction

In this paper we consider a second order multivalued periodic boundary value problem with a nonconvex and unbounded orientor field (set-valued vector field). Using a directionally continuous selector, through its Filippov regularization we produce a convex-valued, bounded multifunction and with this as orientor field we introduce a new multivalued periodic problem. Using the Leray-Schauder principle, we solve the convex problem and then we show that its solutions also solve the original nonconvex problem.

A generalization of Fenchel duality in set-valued vector optimization

A Fenchel duality result is presented for a convex set-valued vector optimization problem under boundedness or continuity hypotheses.

Weak Sharp Solutions of Variational Inequalities

Weak Sharp Solutions of Variational Inequalities

Conjugate Duality in Set-Valued Vector Optimization

In this paper, conjugate duality results for convexlike set-valued vector optimization problems are presented under closedness or boundedness hypotheses. Some properties of the value mapping of a set-valued vector optimization problem are studied. A conjugate duality result is also proved for a convex set-valued vector optimization problem without the requirements of closedness and boundedness.

Optimization with set-functions described by functions

Constrained optimization problems for set-valued vector objective and constraints are studied, where the multifunctions take convex polyhedra as their values. This allows necessary conditions for an optimum, also sufficient conditions, to be specified in terms of conventional functions