Search

E.G. Belousov and V.G. Andronov [Solvability and Stability of Problems of Polynomial Programming (in Russian), Publishing House of the Moscow University, Moscow, p. 4, 1993] have observed that the notions of structural convexity and ravine of a polynomial function, which were introduced by themselves, are useful for studying stability and solvability of convex polynomial mathematical programming problems, as well as for the investigation of the distribution of integer points in convex sets. The results given in Chapters 3-5 of the book justify their observations. This paper presents some facts about structural convexity and ravines of quadratic functions. Among other things, we obtain a verifiable criterion for structural convexity of a quadratic function and show that such a function cannot have ravines along linear subspaces. [ABSTRACT FROM AUTHOR]

By a scalarization method and properties of semi-algebraic sets, it is proved that both the Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the constraint set is polyhedral convex and the basic operators are given by polynomial functions, have finitely many connected components. Consequences of the results for vector optimization problems are discussed in details. The results of this paper solve in the affirmative some open questions for the case of general problems without requiring monotonicity of the operators involved. [ABSTRACT FROM AUTHOR]

By using a scalarization method and some properties of semi-algebraic sets, we prove that both the proper Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the convex constraint set is given by polynomial functions and all the components of the basic operators are polynomial functions, have finitely many connected components, provided that the Mangasarian-Fromovitz constraint qualification is satisfied at every point of the constraint set. In addition, if the proper Pareto solution set is dense in the Pareto solution set, then the latter also has finitely many connected components. Consequences of the results for vector optimization problems are discussed in detail. [ABSTRACT FROM AUTHOR]

In this paper, without using any regularity assumptions, we derive a new exact formula for computing the Fréchet coderivative and an exact formula for the Mordukhovich coderivative of normal cone mappings to perturbed polyhedral convex sets. Our development establishes generalizations and complements of the existing results on the topic. An example to illustrate formulae is given. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study a mixed variational inclusion problem involving infinite family of fuzzy mappings. An iterative algorithm is constructed for solving a mixed variational inclusion problem involving infinite family of fuzzy mappings and the convergence of iterative sequences generated by the proposed algorithm is proved. Some illustrative examples are also given. [ABSTRACT FROM AUTHOR]

This paper presents an exact formula for computing the normal cones of the constraint set mapping including the Clarke normal cone and the Mordukhovich normal cone in infinite programming under the extended Mangasarian-Fromovitz constraint qualification condition. Then, we derive an upper estimate as well as an exact formula for the limiting subdifferential of the marginal/optimal value function in a general Banach space setting. [ABSTRACT FROM AUTHOR]

This paper deals with the generalized Clarke epiderivative of the extremum (or efficient point) multifunction in parametric vector optimization problems. The formulas for computing and/or estimating the generalized Clarke epiderivative of this extremum multifunction are given in terms of the Clarke tangent cone to the graph of a multifunction or the constraint mapping and/or the Fréchet derivative of the objective function. An application to semi-infinite programming is given. [ABSTRACT FROM AUTHOR]

By means of generalized KKM theory, we prove a result on the existence of solutions and we establish general variational principles, that is, vector optimization formulations of set-valued maps for vector generalized systems. A perturbation function is involved in general variational principles. We extend the theory of gap functions for vector variational inequalities to vector generalized systems and we prove that the solution sets of the related vector optimization problems of set-valued maps contain the solution sets of vector generalized systems. A further vector optimization problem is defined in such a way that its solution set coincides with the solution set of a weak vector generalized system. [ABSTRACT FROM AUTHOR]

We study the following generalized quasivariational inequality problem: given a closed convex set X in a normed space E with the dual E*, a multifunction Φ : X→2E* and a multifunction Г : X→2x, find a point ( ^, Ẑ) ϵ X×E* such that ^ ϵ Г( ^), Ẑ ϵ Φ(^), ⟨Ẑ, ^ -y⟩ ⩽ 0, ∀y ϵ Г( ^).We prove some existence theorems in which Φ may be discontinuous, X may be unbounded, and Г is not assumed to be Hausdorff lower semicontinuous. [ABSTRACT FROM AUTHOR]

The auxiliary principle technique is extended to study the generalized strongly nonlinear mixed variational-like inequality problem for set-valued mappings without compact values. We establish first the existence of a solution of the related auxiliary problem. Then, the iterative algorithm for solving that problem is given by using this existence result. Moreover, the existence of a solution of the original problem and the convergence of iterative sequences generated by the algorithm are both derived. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we introduce the concept of a -function defined on a quasi-metric space which generalizes the notion of a -function and a -distance. We establish Ekeland-type variational principles in the setting of quasi-metric spaces with a -function. We also present an equilibrium version of the Ekeland-type variational principle in the setting of quasi-metric spaces with a -function. We prove some equivalences of our variational principles with Caristi–Kirk type fixed point theorems for multivalued maps, the Takahashi minimization theorem and some other related results. As applications of our results, we derive existence results for solutions of equilibrium problems and fixed point theorems for multivalued maps. We also extend the Nadler’s fixed point theorem for multivalued maps to a -function and in the setting of complete quasi-metric spaces. As a consequence, we prove the Banach contraction theorem for a -function and in the setting of complete quasi-metric spaces. The results of this paper extend and generalize many results appearing recently in the literature. [Copyright &y& Elsevier]