On minty variational principle for nonsmooth vector optimization problems with approximate convexity

In this paper, we consider a vector optimization problem involving locally Lipschitz approximately convex functions and give several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Stampacchia and Minty type and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.     

On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity

In this paper, we consider a nonsmooth vector optimization problem involving locally Lipschitz generalized approximate convex functions and find some relations between approximate convexity and generalized approximate convexity. We establish relationships between vector variational inequalities and nonsmooth vector optimization problem using the generalized approximate convexity as a tool.     

Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions.     

On vector optimization problems and vector variational inequalities using convexificators

In this paper, we establish some results which exhibit an application of convexificators in vector optimization problems (VOPs) and vector variational inequaities involving locally Lipschitz functions. We formulate vector variational inequalities of Stampacchia and Minty type in terms of convexificators and use these vector variational inequalities as a tool to find out necessary and sufficient conditions for a point to be a vector minimal point of the VOP. We also consider the corresponding weak versions of the vector variational inequalities and establish several results to find out weak vector minimal points.     

Existence results for Stampacchia and Minty type vector variational inequalities

In this article, we consider the general forms of Stampacchia and Minty type vector variational inequalities for bifunctions and establish the existence of their solutions in the setting of topological vector spaces. We extend these vector variational inequalities for set-valued maps and prove the existence of their solutions in the setting of Banach spaces as well as topological vector spaces. We point out that our vector variational inequalities extend and generalize several vector variational inequalities that appeared in the literature. As applications, we establish some existence results for a solution of the vector optimization problem by using Stampacchia and Minty type vector variational inequalities.     

Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints

This paper mainly intends to present some semicontinuity and convergence results for perturbed vector optimization problems with approximate equilibrium constraints. We establish the lower semicontinuity of the efficient solution mapping for the vector optimization problem with perturbations of both the objective function and the constraint set. The constraint set is the set of approximate weak efficient solutions of the vector equilibrium problem. Moreover, upper Painlevé–Kuratowski convergence results of the weak efficient solution mapping are showed. Finally, some applications to the optimization problems with approximate vector variational inequality constraints and the traffic network equilibrium problems are also given. Our main results are different from the ones in the literature.     

On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel–Penot subdifferentials

In this paper, we establish some results which exhibit an application for Michel–Penot subdifferential in nonsmooth vector optimization problems and vector variational-like inequalities. We formulate vector variational-like inequalities of Stampacchia and Minty type in terms of the Michel–Penot subdifferentials and use these variational-like inequalities as a tool to solve the vector optimization problem involving nonsmooth V-invex function. We also consider the corresponding weak versions of the vector variational-like inequalities and establish various results for the weak efficient solutions.     

Existence of Solutions of Systems of Generalized Implicit Vector Variational Inequalities

We consider five different types of systems of generalized vector variational inequalities and derive relationships among them. We introduce the concept of pseudomonotonicity for a family of multivalued maps and prove the existence of weak solutions of these problems under these pseudomonotonicity assumptions in the setting of Hausdorff topological vector spaces as well as real Banach spaces. We also establish the existence of a strong solution of our problems under lower semicontinuity for a family of multivalued maps involved in the formulation of the problems. By using a nonlinear scalar function, we introduce gap functions for our problems by which we can solve systems of generalized vector variational inequalities using optimization techniques. The first two authors were supported by SABIC and Fast Track Research Grants SAB-2006-05. They are grateful to the Department of Mathematical Sciences, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia for providing excellent research facilities.     

Relationships between interval-valued vector optimization problems and vector variational inequalities

In this paper, we study some relationships between interval-valued vector optimization problems and vector variational inequalities under the assumptions of LU-convex smooth and non-smooth objective functions. We identify the weakly efficient points of the interval-valued vector optimization problems and the solutions of the weak vector variational inequalities under smooth and non-smooth LU-convexity assumptions.     

A non-smooth version of Minty variational principle

The aim of this article is to study the relationship between generalized Minty vector variational inequalities and non-smooth vector optimization problems. Under pseudoconvexity or pseudomonotonicity, we establish the relationship between an efficient solution of a non-smooth vector optimization problem and a generalized Minty vector variational inequality. This offers a non-smooth version of existing Minty variational principle.     

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 Mathematics Subject Classification(2000). 49J40, 65K10, 90C29     

Existence of Solutions and Variational Principles for Generalized Vector Systems

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. Research carried on within the agreement between National Sun Yat-Sen University of Kaohsiung, Taiwan and Pisa University, Pisa, Italy, 2007. L.C. Ceng research was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality grant (075105118). J.C. Yao research was partially supported by the National Science Center for Theoretical Sciences at Tainan.     

On the Gap Functions of Prevariational Inequalities

Gap functions play a crucial role in transforming a variational inequality problem into an optimization problem. Then, methods solving an optimization problem can be exploited for finding a solution of a variational inequality problem. It is known that the so-called prevariational inequality is closely related to some generalized convex functions, such as linear fractional functions. In this paper, gap functions for several kinds of prevariational inequalities are investigated. More specifically, prevariational inequalities, extended prevariational inequalities, and extended weak vector prevariational inequalities are considered. Furthermore, a class of gap functions for inequality constrained prevariational inequalities is investigated via a nonlinear Lagrangian.     

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.     

System of nonsmooth variational inequalities with applications

In this paper, we consider a system of vector variational inequalities and a system of nonsmooth variational inequalities defined by means of Clarke directional derivative. We also consider the Nash equilibrium problem with vector pay-offs and its scalarized form. We present some relations among these systems and problems. The existence results for a solution of system of nonsmooth variational inequalities are given. As a consequence, we derive an existence result for a solution of Nash equilibrium problem with vector pay-offs.     

Generalized Minty Vector Variational-Like Inequalities and Vector Optimization Problems

In this paper, we study the relationship among the generalized Minty vector variational-like inequality problem, generalized Stampacchia vector variational-like inequality problem and vector optimization problem for nondifferentiable and nonconvex functions. We also consider the weak formulations of the generalized Minty vector variational-like inequality problem and generalized Stampacchia vector variational-like inequality problem and give some relationships between the solutions of these problems and a weak efficient solution of the vector optimization problem.     

Weak minimizers,minimizers and variational inequalities for set-valued functions. A blooming wreath?

Recently, necessary and sufficient conditions in terms of variational inequalities have been introduced to characterize minimizers of convex set-valued functions. Similar results have been proved for a weaker concept of minimizers and weaker variational inequalities. The implications are proved using scalarization techniques that eventually provide original problems, not fully equivalent to the set-valued counterparts. Therefore, we try, in the course of this note, to close the network among the various notions proposed. More specifically, we prove that a minimizer is always a weak minimizer, and a solution to the stronger variational inequality always also a solution to the weak variational inequality of the same type. As a special case, we obtain a complete characterization of efficiency and weak efficiency in vector optimization by set-valued variational inequalities and their scalarizations. Indeed, this might eventually prove the usefulness of the set optimization approach to renew the study of vector optimization.     

Hausdorff continuity of approximate solution maps to parametric primal and dual equilibrium problems

In this paper, we consider parametric primal and dual equilibrium problems in locally convex Hausdorff topological vector spaces. Sufficient conditions for the approximate solution maps to be Hausdorff continuous are established. We provide many examples to illustrate the essentialness of the imposed assumptions. As applications of these results, the Hausdorff continuity of the approximate solution maps for optimization problems, variational inequalities and fixed-point problems are derived.     

Vector variational inequalities on Hadamard manifolds involving strongly geodesic convex functions

This paper is intended to study the vector variational inequalities on Hadamard manifolds. Generalized Minty and Stampacchia vector variational inequalities are introduced involving generalized subdifferential. Under strongly geodesic convexity, relations between solutions of these inequalities and a nonsmooth vector optimization problem are established. To illustrate the relationship between a solution of generalized weak Stampacchia vector variational inequality and weak efficiency of a nonsmooth vector optimization problem, a non-trivial example is presented.     

Generalized vector variational-like inequalities and vector optimization

In this paper, we consider different kinds of generalized vector variational-like inequality problems and a vector optimization problem. We establish some relationships between the solutions of generalized Minty vector variational-like inequality problem and an efficient solution of a vector optimization problem. We define a perturbed generalized Stampacchia vector variational-like inequality problem and discuss its relation with generalized weak Minty vector variational-like inequality problem. We establish some existence results for solutions of our generalized vector variational-like inequality problems.