Levitin–Polyak well-posedness of symmetric vector quasi-equilibrium problems

In this paper, we introduce generalized Levitin–Polyak well-posedness of symmetric strong vector quasi-equilibrium problem. We give characterizations for generalized Levitin–Polyak well-posedness of the symmetric strong vector quasi-equilibrium problem and the symmetric weak vector quasi-equilibrium problem by closed graph of the approximating solution mapping. Our results improve the main result presented in Zhang.     

Levitin–Polyak well-posedness by perturbations of inverse variational inequalities

The purpose of this paper is to investigate Levitin–Polyak type well-posedness for inverse variational inequalities. We establish some metric characterizations of Levitin–Polyak α-well-posedness by perturbations. Under suitable conditions, we prove that Levitin–Polyak well-posedness by perturbations of an inverse variational inequality is equivalent to the existence and uniqueness of its solution. Moreover, we show that Levitin–Polyak well-posedness by perturbations of an inverse variational inequality is equivalent to Levitin–Polyak well-posedness by perturbations of an enlarged classical variational inequality.     

Characterizations of Levitin–Polyak well-posedness by perturbations for the split variational inequality problem

The purpose of this paper is to investigate Levitin–polyak well-posedness by perturbations of the split variational inequality problem in reflexive Banach spaces. Furi-Vignoli-type characterizations are established for the well-posedness. We prove that the weak generalized Levitin–Polyak well-posedness by perturbations is equivalent to the nonemptiness and boundedness of the solution set of the problem. Finally, we discuss the relations between the Levitin–Polyak well-posedness by perturbations of the split variational inequality problem and the Levitin–Polyak well-posedness by perturbations of the split minimization problem when the split variational inequality problem arises from the split minimization problem.     

Well-posedness for convex symmetric vector quasi-equilibrium problems

In this paper, the notion of a generalized Levitin–Polyak well-posedness is defined for symmetric vector quasi-equilibrium problems. Sufficient conditions are given for the generalized Levitin–Polyak well-posedness. Moreover, it is shown that the results can be refined in the convex case.     

Levitin–Polyak well-posedness by perturbations for the split inverse variational inequality problem

In this paper, we extend the notion of Levitin–Polyak wellposedness by perturbations to the split inverse variational inequality problem. We derive metric characterizations of Levitin–Polyak wellposedness by perturbations. Under mild conditions, we prove that the Levitin–Polyak well-posedness by perturbations of the split inverse variational inequality problem is equivalent to the existence and uniqueness of its solution.     

Levitin–Polyak well-posedness in set optimization concerning Pareto efficiency

This article aims to elaborate on various notions of Levitin–Polyak well-posedness for set optimization problems concerning Pareto efficient solutions. These notions are categorized into two classes including pointwise and global Levitin–Polyak well-posedness. We give various characterizations of both pointwise and global Levitin–Polyak well-posedness notions for set optimization problems. The hierarchical structure of their relationships is also established. Under suitable conditions on the input data of set optimization problems, we investigate the closedness of Pareto efficient solution sets in which they are different from the weakly efficient ones. Furthermore, we provide sufficient conditions for global Levitin–Polyak well-posedness properties of the reference problems without imposing the information on efficient solution sets.

     

Levitin–Polyak well-posedness for strong bilevel vector equilibrium problems and applications to traffic network problems with equilibrium constraints

In this paper we consider strong bilevel vector equilibrium problems and introduce the concepts of Levitin–Polyak well-posedness and Levitin–Polyak well-posedness in the generalized sense for such problems. The notions of upper/lower semicontinuity involving variable cones for vector-valued mappings and their properties are proposed and studied. Using these generalized semicontinuity notions, we investigate sufficient and/or necessary conditions of the Levitin–Polyak well-posedness for the reference problems. Some metric characterizations of these Levitin–Polyak well-posedness concepts in the behavior of approximate solution sets are also discussed. As an application, we consider the special case of traffic network problems with equilibrium constraints.     

Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints

The Levitin–Polyak well-posedness for a constrained problem guarantees that, for an approximating solution sequence, there is a subsequence which converges to a solution of the problem. In this article, we introduce several types of (generalized) Levitin–Polyak well-posednesses for a vector variational inequality problem with both abstract and functional constraints. Various criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posednesses are presented.     

Levitin-Polyak Well-Posedness of Constrained Inverse Quasivariational Inequality

In this article, we introduce and study different types of Levitin–Polyak well-posedness for a constrained inverse quasivariational inequality problem. Criteria and characterizations for these types of well-posedness for inverse quasivariational inequality problems are given. Su?cient conditions for the Levitin–Polyak well-posedness of inverse quasivariational inequality problems are also established.     

Levitin–Polyak well-posedness by perturbations of split minimization problems

In this paper, we extend well-posedness notions to the split minimization problem which entails finding a solution of one minimization problem such that its image under a given bounded linear transformation is a solution of another minimization problem. We prove that the split minimization problem in the setting of finite-dimensional spaces is Levitin–Polyak well-posed by perturbations provided that its solution set is nonempty and bounded. We also extend well-posedness notions to the split inclusion problem. We show that the well-posedness of the split convex minimization problem is equivalent to the well-posedness of the equivalent split inclusion problem.