Well-posedness for vector equilibrium problems

We introduce and study two notions of well-posedness for vector equilibrium problems in topological vector spaces; they arise from the well-posedness concepts previously introduced by the same authors in the scalar case, and provide an extension of similar definitions for vector optimization problems. The first notion is linked to the behaviour of suitable maximizing sequences, while the second one is defined in terms of Hausdorff convergence of the map of approximate solutions. In this paper we compare them, and, in a concave setting, we give sufficient conditions on the data in order to guarantee well-posedness. Our results extend similar results established for vector optimization problems known in the literature.      

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.     

Well-posed constrained optimization problems in metric spaces

Relations between different notions of well-posedness of constrained optimization problems are studied. A characterization of the class of metric spaces in which Hadamard, strong, and Levitin-Polyak well-posedness of continuous minimization problems coincide is given. It is shown that the equivalence between the original Tikhonov well-posedness and the ones above provides a new characterization of the so-called Atsuji spaces. Generalized notions of well-posedness, not requiring uniqueness of the solution, are introduced and investigated in the above spirit.     

Well-posedness for Optimization Problems with Constraints defined by Variational Inequalities having a unique solution

We introduce various notions of well-posedness for a family of variational inequalities and for an optimization problem with constraints defined by variational inequalities having a unique solution. Then, we give sufficient conditions for well-posedness of these problems and we present an application to an exact penalty method.     

On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems

We introduce the notions of conditioning and well-posedness for equilibrium problems. Using these concepts, we obtain finite and strong convergence results for the proximal method that improve, develop, and unify several theorems in optimization and nonlinear analysis.     

Solving Strategies and Well-Posedness in Linear Semi-Infinite Programming

In this paper we introduce the concept of solving strategy for a linear semi-infinite programming problem, whose index set is arbitrary and whose coefficient functions have no special property at all. In particular, we consider two strategies which either approximately solve or exactly solve the approximating problems, respectively. Our principal aim is to establish a global framework to cope with different concepts of well-posedness spread out in the literature. Any concept of well-posedness should entail different properties of these strategies, even in the case that we are not assuming the boundedness of the optimal set. In the paper we consider three desirable properties, leading to an exhaustive study of them in relation to both strategies. The more significant results are summarized in a table, which allows us to show the double goal of the paper. On the one hand, we characterize the main features of each strategy, in terms of certain stability properties (lower and upper semicontinuity) of the feasible set mapping, optimal value function and optimal set mapping. On the other hand, and associated with some cells of the table, we recognize different notions of Hadamard well-posedness. We also provide an application to the analysis of the Hadamard well-posedness for a linear semi-infinite formulation of the Lagrangian dual of a nonlinear programming problem.     

Levitin–Polyak well-posedness for parametric quasivariational inequality problem of the Minty type

In this paper, we introduce the notions of Levitin?CPolyak (LP) well-posedness and Levitin?CPolyak well-posedness in the generalized sense, for a parametric quasivariational inequality problem of the Minty type. Metric characterizations of LP well-posedness and generalized LP well-posedness, in terms of the approximate solution sets are presented. A parametric gap function for the quasivariational inequality problem is introduced and an equivalence relation between LP well-posedness of the parametric quasivariational inequality problem and that of the related optimization problem is obtained.     

Well-Posedness for Variational Inequality Problems with Generalized Monotone Set-Valued Maps

In this paper, we introduce two new classes of generalized monotone set-valued maps, namely relaxed μ–p monotone and relaxed μ–p pseudomonotone. Relations of these classes with some other well-known classes of generalized monotone maps are investigated. Employing these new notions, we derive existence and well-posedness results for a set-valued variational inequality problem. Our results generalize some of the well-known results. A gap function is proposed for the variational inequality problem and a lower error bound is obtained under the assumption of relaxed μ–p pseudomonotonicity. An equivalence relation between the well-posedness of the variational inequality problem and that of a related optimization problem pertaining to the gap function is also presented.     

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.     

Tykhonov well-posedness for lexicographic equilibrium problems

In this paper, we consider the vector equilibrium problems involving lexicographic cone in Banach spaces. We introduce the new concepts of the Tykhonov well-posedness for such problems. The corresponding concepts of the Tykhonov well-posedness in the generalized sense are also proposed and studied. Some metric characterizations of well-posedness for such problems are given. As an application of the main results, several results on well-posedness for the class of lexicographic variational inequalities are derived.     

Levitin–Polyak Well-Posedness for Optimization Problems with Generalized Equilibrium Constraints

In this paper, we consider Levitin–Polyak well-posedness of parametric generalized equilibrium problems and optimization problems with generalized equilibrium constraints. Some criteria for these types of well-posedness are derived. In particular, under certain conditions, we show that generalized Levitin–Polyak well-posedness of a parametric generalized equilibrium problem is equivalent to the nonemptiness and compactness of its solution set. Finally, for an optimization problem with generalized equilibrium constraints, we also obtain that, under certain conditions, Levitin–Polyak well-posedness in the generalized sense is equivalent to the nonemptiness and compactness of its solution set.     

Levitin-Polyak well-posedness of a generalized mixed variational inequality in Banach spaces

In this paper, we first introduce the concept of Levitin-Polyak well-posedness of a generalized mixed variational inequality in Banach spaces and establish some characterizations of its Levitin-Polyak well-posedness. Under suitable conditions, we prove that the Levitin-Polyak well-posedness of a generalized mixed variational inequality is equivalent to the Levitin-Polyak well-posedness of a corresponding inclusion problem and a corresponding fixed point problem. We also derive some conditions under which a generalized mixed variational inequality in Banach spaces is Levitin-Polyak well-posed.     

弱向量均衡问题的含参适定性

本文在实 Banach 空间中研究了弱向量均衡问题的两种适定性.给出了该问题唯一适定与适定的距离刻划.在适当条件下证明了弱向量均衡问题的唯一适定性等价于解的存在性与唯一性.最后, 文章在有限维空间给出了弱向量均衡问题适定的充分性条件.     

The Levitin-Polyak well-posedness by perturbations for systems of general variational inclusion and disclusion problems

In this paper, the notions of the Levitin-Polyak well-posedness by perturbations for system of general variational inclusion and disclusion problems (shortly, (SGVI) and (SGVDI)) are introduced in Hausdorff topological vector spaces. Some sufficient and necessary conditions of the Levitin-Polyak well-posedness by perturbations for (SGVI) (resp., (SGVDI)) are derived under some suitable conditions. We also explore some relations among the Levitin-Polyak well-posedness by perturbations, the existence and uniqueness of solution of (SGVI) and (SGVDI), respectively. Finally, the lower (upper) semicontinuity of the approximate solution mappings of (SGVI) and (SGVDI) are established via the Levitin-Polyak well-posedness by perturbations.     

Well-Posedness Under Relaxed Semicontinuity for Bilevel Equilibrium and Optimization Problems with Equilibrium Constraints

Bilevel equilibrium and optimization problems with equilibrium constraints are considered. We propose a relaxed level closedness and use it together with pseudocontinuity assumptions to establish sufficient conditions for well-posedness and unique well-posedness. These conditions are new even for problems in one-dimensional spaces, but we try to prove them in general settings. For problems in topological spaces, we use convergence analysis while for problems in metric cases we argue on diameters and Kuratowski’s, Hausdorff’s, or Istrǎtescu’s measures of noncompactness of approximate solution sets. Besides some new results, we also improve or generalize several recent ones in the literature. Numerous examples are provided to explain that all the assumptions we impose are very relaxed and cannot be dropped.     

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.

     

Well-Posedness and Scalarization in Vector Optimization

In this paper, we study several existing notions of well- posedness for vector optimization problems. We separate them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are well posed.The authors thank Professor C. Zălinescu for pointing out some inaccuracies in Ref. 11. His remarks allowed the authors to improve the present work.     

Scalarization and pointwise well-posedness in vector optimization problems

The aim of this paper is applying the scalarization technique to study some properties of the vector optimization problems under variable domination structure. We first introduce a nonlinear scalarization function of the vector-valued map and then study the relationships between the vector optimization problems under variable domination structure and its scalarized optimization problems. Moreover, we give the notions of DH-well-posedness and B-well-posedness under variable domination structure and prove that there exists a class of scalar problems whose well-posedness properties are equivalent to that of the original vector optimization problem.     

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.     

The Glowinski–Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces

In this paper, we introduce a new approach for solving equilibrium problems in Hilbert spaces. First, we transform the equilibrium problem into the problem of finding a zero of a sum of two maximal monotone operators. Then, we solve the resulting problem using the Glowinski–Le Tallec splitting method and we obtain a linear rate of convergence depending on two parameters. In particular, we enlarge significantly the range of these parameters given rise to the convergence. We prove that the sequence generated by the new method converges to a global solution of the considered equilibrium problem. Finally, numerical tests are displayed to show the efficiency of the new approach.