The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems

In this paper, the notion of the generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems are investigated. By using the gap functions of the system of vector quasi-equilibrium problems, we establish the equivalent relationship between the generalized Tykhonov well-posedness of the system of vector quasi-equilibrium problems and that of the minimization problems. We also present some metric characterizations for the generalized Tykhonov well-posedness of the system of vector quasi-equilibrium problems. The results in this paper are new and extend some known results in the literature.     

The Well-Posedness for Multiobjective Generalized Games

In this paper, the new notions of the generalized Tykhonov well-posedness for multiobjective generalized games are investigated. By using the gap functions of the multiobjective generalized games, we establish the equivalent relationship between the generalized Tykhonov well-posedness of the multiobjective generalized games and that of the minimization problems. Some metric characterizations for the generalized Tykhonov well-posedness of the multiobjective generalized games are also presented.     

Metrically well-set minimization problems

A concept of well-posedness, or more exactly of stability in a metric sense, is introduced for minimization problems on metric spaces generalizing the notion due to Tykhonov to situations in which there is no uniqueness of solutions. It is compared with other concepts, in particular to a variant of the notion after Hadamard reformulated via a metric semicontinuity approach. Concrete criteria of well-posedness are presented, e.g., for convex minimization problems.     

The nucleolus is well-posed

The lexicographic order is not representable by a real-valued function, contrary to many other orders or preorders. So, standard tools and results for well-posed minimum problems cannot be used. We prove that under suitable hypotheses it is however possible to guarantee the well-posedness of a lexicographic minimum over a compact or convex set. This result allows us to prove that some game theoretical solution concepts, based on lexicographic order are well-posed: in particular, this is true for the nucleolus.     

Unified Approaches to Well-Posedness with Some Applications

We present unified approaches to Hadamard and Tykhonov well-posedness. As applications, we deduce Tykhonov well- posedness for optimization problems, Nash equilibrium point problems and fixed point problems etc. Especially, by applying such approaches, we deal with the well- posedness as stated in (Lignola and Morgan (2000), Journal of Global Optimization 16, 57–67) in which Lignola and Morgan investigated directly and intensively Tykhonov types of well- posedness for optimization problems with constraints defined by variational inequalities, namely, generalized well- posedness and strong well- posedness. We give some sufficient conditions for Hadamard well- posedness of such problems and deduce relations between Hadamard type and Tykhonov type of well- posedness. Finally, as corollaries, we derive generalized well- posedness and strong well- posedness for these problems.     

关于集值目标映射的向量平衡问题的广义Tykhonov适定性

引入集值目标映射的向量平衡问题的两类广义Tykhonov适定性,利用非紧性Kuratowski测度给出它们的度量刻划和讨论这两类适定性的充分性条件.最后证明向量平衡问题的广义Tykhonov适定性与约束极小化问题的广义Tykhonov适定性之间的等价关系.     

Scalarization for pointwise well-posed vectorial problems

The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class of scalar problems whose well-posedness properties are equivalent with the most known well-posedness properties of the original problem. Then a well-posedness property of a quasiconvex level-closed problem is derived.      

Well-posedness and stability for abstract spline problems

In this work well-posedness and stability properties of the abstract spline problem are studied in the framework of reflexive spaces. Tykhonov well-posedness is proved without restrictive assumptions. In the context of Hilbert spaces, also the stronger notion of Levitin-Polyak well-posedness is established. A sequence of parametric problems converging to the given abstract spline problem is considered in order to study stability. Under natural assumptions, convergence results for sequences of solutions of the perturbed problems are obtained.     

Pointwise well-posedness in set optimization with cone proper sets

This paper deals with the well-posedness property in the setting of set optimization problems. By using a notion of well-posed set optimization problem due to Zhang et al. (2009) [18] and a scalarization process, we characterize this property through the well-posedness, in the Tykhonov sense, of a family of scalar optimization problems and we show that certain quasiconvex set optimization problems are well-posed. Our approach is based just on a weak boundedness assumption, called cone properness, that is unavoidable to obtain a meaningful set optimization problem.     

A variational approach to second-order approximability of sliding mode control systems

We consider robustness properties of second-order methods for the sliding mode control of nonlinear ordinary differential equations. A new approach is presented based on the theory of well-posed optimization problems. It is shown that the convergence of the real states of the control system to the ideal one is intimately related to Tykhonov well-posedness of suitably defined dynamic optimization problems.     

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-posedness for general parametric quasi-variational inclusion problems

In this paper, we aim to suggest the new concept of well-posedness for the general parametric quasi-variational inclusion problems (QVIP). The corresponding concepts of well-posedness in the generalized sense are also introduced and investigated for QVIP. Some metric characterizations of well-posedness for QVIP are given. We prove that under suitable conditions, the well-posedness is equivalent to the existence of uniqueness of solutions. As applications, we obtain immediately some results of well-posedness for the parametric quasi-variational inclusion problems, parametric vector quasi-equilibrium problems and parametric quasi-equilibrium problems.     

Lexicographic variational inequalities with applications

In this article, we consider equivalence properties between various kinds of lexicographic variational inequalities. By employing various concepts of monotonicity, we show that the usual sequential variational inequality is equivalent to the direct lexicographic variational inequality or to the dual lexicographic variational inequality. We establish several existence results for lexicographic variational inequalities. Also, we introduce the lexicographic complementarity problem and establish its equivalence with the lexicographic variational inequality. We illustrate our approach by several examples of applications to vector transportation and vector spatial equilibrium problems.     

Well-posedness for parametric quasivariational inequality problems and for optimization problems with quasivariational inequality constraints

In this article, the concepts of well-posedness and well-posedness in the generalized sense are introduced for parametric quasivariational inequality problems with set-valued maps. Metric characterizations of well-posedness and well-posedness in the generalized sense, in terms of the approximate solutions sets, are presented. Characterization of well-posedness under certain compactness assumptions and sufficient conditions for generalized well-posedness in terms of boundedness of approximate solutions sets are derived. The study is further extended to discuss well-posedness for an optimization problem with quasivariational inequality constraints.     

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.      

General Information

We consider vector equilibrium problems using the lexicographic order. We show that several classes of inverse lexicographic optimization problems can be reduced to lexicographic vector equilibrium problems. Some approaches to solve such problems are also suggested.     

Well-posed equilibrium problems

In this paper we introduce some notions of well-posedness for scalar equilibrium problems in complete metric spaces or in Banach spaces. As equilibrium problem is a common extension of optimization, saddle point and variational inequality problems, our definitions originates from the well-posedness concepts already introduced for these problems.We give sufficient conditions for two different kinds of well-posedness and show by means of counterexamples that these have no relationship in the general case. However, together with some additional assumptions, we show via Ekeland’s principle for bifunctions a link between them.Finally we discuss a parametric form of the equilibrium problem and introduce a well-posedness concept for it, which unifies the two different notions of well-posedness introduced in the first part.     

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.     

Piecewise lexicographic programming: A new model for practical decision problems

A new model for practical decision problems is presented. It allows one to consider lexicographic preference structures by introducing the new class of piecewise lexicographic functions which impose a total order in the objective-and-constraint space. In this way, the concepts of objective and constraints are merged into a new unified notion of co-objective. Moreover, the lexicographic preference structure may be applied not only among different coobjectives, but also among different ranges of the same decision variable. The main merits of this model appear to be its versatility (it is able to deal with different types of multiobjective optimization situations without requiring user interaction) and its compactness (it does not require one to increase the original number of decision variables and constraints). A linear version of the model is investigated in more detail.