A systematization of convexity and quasiconvexity concepts for set-valued maps,defined by l-type and u-type preorder relations

Abstract

In this paper, we study different classes of generalized convex/quasiconvex set-valued maps, defined by means of the l-type and u-type preorder relations, currently used in set-valued optimization. In particular, we identify those classes of set-valued maps for which it is possible to extend the classical characterization of convex real-valued functions by quasiconvexity of their affine perturbations.     

Moreau–Rockafellar Theorems for Nonconvex Set-Valued Maps

In this paper, we introduce the notion of (Benson) proper subgradient of a set-valued map and prove that, for some class of nonconvex set-valued maps, a proper subgradient of the sum of two set-valued maps can be expressed as the sum of two proper subgradients of these maps. This property is also established for weak subgradients. A result in Ref. [Lin, L.J.: J. Math. Anal. Appl. 186, 30–51 (1994)], obtained under some convexity assumption, is included as a special case of the corresponding result of this paper. The author thanks the anonymous referees for their valuable remarks.     

DEMICONTINUITY,GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS

Abstract

The aim of this paper is to establish the existence of loose saddle points for a set-valued map which is defined in a topological vector space and possesses the demicontinuity and generalized convexity. Our results strengthen several previously obtained results on the existence of saddle and loose saddle points for single- or set-valued maps.     

On Ha＇s Version of Set-valued Ekeland＇s Variational Principle

By using the concept of cone extensions and Dancs-Hegedus-Medvegyev theorem, Ha [Some variants of the Ekeland variational principle for a set-valued map. J. Optim. Theory Appl., 124, 187–206 (2005)] established a new version of Ekeland’s variational principle for set-valued maps, which is expressed by the existence of strict approximate minimizer for a set-valued optimization problem. In this paper, we give an improvement of Ha’s version of set-valued Ekeland’s variational principle. Our proof is direct and it need not use Dancs-Hegedus-Medvegyev theorem. From the improved Ha’s version, we deduce a Caristi-Kirk’s fixed point theorem and a Takahashi’s nonconvex minimization theorem for set-valued maps. Moreover, we prove that the above three theorems are equivalent to each other.     

Characterizations of strictly convex sets by the uniqueness of support points

Abstract

This short paper characterizes strictly convex sets by the uniqueness of support points (such points are called unique support points or exposed points) under appropriate assumptions. A class of so-called regular sets, for which every extreme point is a unique support point, is introduced. Closed strictly convex sets and their intersections with some other sets are shown to belong to this class. The obtained characterizations are then applied to set-valued maps and to the separation of a convex set and a strictly convex set. Under suitable assumptions, so-called set-valued maps with path property are characterized by strictly convex images of the considered set-valued map.     

On Higher-Order Sensitivity Analysis of Parametric Henig Set-Valued Equilibrium Problems

Abstract

In the article, we discuss sensitivity analysis of a parametric Henig set-valued equilibrium problem. In detail, relationships between the higher-order contingent derivative of the solution map of this problem and those of objective and constraint maps are established. Finally, applications to parametric set-valued optimization problems are given.     

Existence of equilibria of set-valued maps on bounded epi-Lipschitz domains in Hilbert spaces without invariance conditions

In this paper, we provide a new result of the existence of equilibria for set-valued maps on bounded closed subsets K of Hilbert spaces. We do not impose either convexity or compactness assumptions on K but we assume that K has epi-Lipschitz sections, i.e. its intersection with suitable finite dimensional spaces is locally the epigraph of Lipschitz functions. In finite dimensional spaces, the famous Brouwer theorem asserts the existence of a fixed point for a continuous function from a compact convex set K to itself. Our result could be viewed as a kind of generalization of this classical result in the context of Hilbert spaces and when the function (or the set-valued map) does not necessarily map K into itself (K is not invariant under the map). Our approach is based firstly on degree theory for compact and for condensing set-valued maps and secondly on flows generated by trajectories of differential inclusions.     

Strongly convex set-valued maps

We introduce the notion of strongly $t$ -convex set-valued maps and present some properties of it. In particular, a Bernstein–Doetsch and Sierpiński-type theorems for strongly midconvex set-valued maps, as well as a Kuhn-type result are obtained. A representation of strongly $t$ -convex set-valued maps in inner product spaces and a characterization of inner product spaces involving this representation is given. Finally, a connection between strongly convex set-valued maps and strongly convex sets is presented.     

Quasicontinuous functions,minimal usco maps and topology of pointwise convergence

In [HOLá, Ľ.—HOLY, D.: Pointwise convergence of quasicontinuous mappings and Baire spaces, Rocky Mountain J. Math.] a complete answer is given, for a Baire space X, to the question of when the pointwise limit of a sequence of real-valued quasicontinuous functions defined on X is quasicontinuous. In [HOLá, Ľ.—HOLY, D.: Minimal USCO maps, densely continuous forms and upper semicontinuous functions, Rocky Mountain J. Math. 39 (2009), 545–562], a characterization of minimal USCO maps by quasicontinuous and subcontinuous selections is proved. Continuing these results, we study closed and compact subsets of the space of quasicontinuous functions and minimal USCO maps equipped with the topology of pointwise convergence. We also study conditions under which the closure of the graph of a set-valued mapping which is the pointwise limit of a net of set-valued mappings, is a minimal USCO map.     

Explicitly quasiconvex set-valued optimization

The principal aim of this paper is to extend some recent results concerning the contractibility of efficient sets and the Pareto reducibility in multicriteria explicitly quasiconvex optimization problems to similar vector optimization problems involving set-valued objective maps. To this end, an appropriate notion of generalized convexity is introduced for set-valued maps taking values in a partially ordered real linear space, which naturally extends the classical concept of explicit quasiconvexity of real-valued functions. Actually, the class of so-called explicitly cone-quasiconvex set-valued maps in particular contains the cone-convex set-valued maps, and it is contained in the class of cone-quasiconvex set-valued maps.      

Optimality Conditions and Synthesis for the Minimum Time Problem

We study the minimum time optimal control problem for a nonlinear system in R ⁿ with a general target. Necessary and sufficient optimality conditions are obtained. In particular, we describe a class of costates that are included in the superdifferential of the minimum time function, even in the case when this function is only lower semicontinuous. Two set-valued maps are constructed to provide time optimal synthesis.     

Dissipativity theory for discontinuous dynamical systems: Basic input, state, and output properties, and finite-time stability of feedback interconnections

In this paper, we develop dissipativity theory for discontinuous dynamical systems. Specifically, using set-valued supply rate maps and set-valued connective supply rate maps consisting of locally Lebesgue integrable supply rates and connective supply rates, respectively, and set-valued storage maps consisting of piecewise continuous storage functions, dissipativity properties for discontinuous dynamical systems are presented. Furthermore, extended Kalman–Yakubovich–Popov set-valued conditions, in terms of the discontinuous system dynamics, characterizing dissipativity via generalized Clarke gradients and locally Lipschitz continuous storage functions are derived. Finally, these results are used to develop feedback interconnection stability results for discontinuous dynamical systems by appropriately combining the set-valued storage maps for the forward and feedback systems.     

A selection theorem for a new class of set-valued maps

A new class of set-valued maps that includes all upper and lower semicontinuous set-valued maps is introduced. For this class, a selection theorem having applications in the theory of differential inclusions is presented. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 503–507, October, 1999.     

An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets

Abstract

This paper contains a generalized Gordan-type alternative theorem for set-valued maps which characterizes set relations without any convexity assumptions using certain evaluation functions. As a direct consequence and as a good example, we discuss robustness (or stability) of linear programming problems for modelling error. Moreover, this theorem can be utilized for that of general vector optimization problems in special cases due to reformation of the evaluation functions.     

On Optimization Problems with Set-Valued Objective Maps: Existence and Optimality

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets of n-dimensional Euclidean space. Second, by using these quasi orderings, we define the concepts of lower semi-continuity for set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and we give some conditions under which these optimal solutions exist to the problems and give necessary and sufficient conditions for optimality.     

A generalization of Hahn-Banach extension theorem

In this paper, the notion of affinelike set-valued maps is introduced and some properties of these maps are presented. Then a new Hahn-Banach extension theorem with a K-convex set-valued map dominated by an affinelike set-valued map is obtained.     

On optimization problems with set-valued objective maps

In this paper, we consider constrained optimization problems with set-valued objective maps. First, we define three types of quasi orderings on the set of all non-empty subsets in n-dimensional Euclidean space and investigate their properties. Next, by using these orderings, we define the concepts of the convexities to set-valued maps and investigate their properties. Finally, based on these results, we define the concepts of optimal solutions to constrained optimization problems with set-valued objective maps and characterize their properties.     

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.     

Cascade search for preimages and coincidences: Global and local versions

In previous papers of the author, the cascade search principle was proposed, which makes it possible to construct a set-valued self-map of a metric spaceX from a set-valued functional or a collection of set-valued maps of X so that the new map generates a multicascade, i.e., a set-valued discrete dynamical system whose limit set coincides with the zero set of the given functional, with the coincidence set of the given collection, or with the common preimage of a closed subspace under the maps from this collection. Stability issues of cascade search were studied. This paper is devoted to a generalization and local modifications of the cascade search principle and their applications to problems concerning local search and approximation of common preimages of subspaces and coincidence sets for finite collections of set-valued maps of metric spaces.     

Lagrange multipliers for set-valued optimization problems associated with coderivatives

In this paper we investigate a vector optimization problem (P) where objective and constraints are given by set-valued maps. We show that by mean of marginal functions and suitable scalarizing functions one can characterize certain solutions of (P) as solutions of a scalar optimization problem (SP) with single-valued objective and constraint functions. Then applying some classical or recent results in optimization theory to (SP) and using estimates of subdifferentials of marginal functions, we obtain optimality conditions for (P) expressed in terms of Lagrange or sequential Lagrange multipliers associated with various coderivatives of the set-valued data.