Extended well-posedness of optimization problems

The well-posedness concept introduced in Ref. 1 for global optimization problems with a unique solution is generalized here to problems with many minimizers, under the name of extended well-posedness. It is shown that this new property can be characterized by metric criteria, which parallel to some extent those known about generalized Tikhonov well-posedness.This work was partially supported by MURST, Fondi 40%, Rome, Italy.     

Extended Well-Posedness Properties of Vector Optimization Problems

In this paper, the concept of extended well-posedness of scalar optimization problems introduced by Zolezzi is generalized to vector optimization problems in three ways: weakly extended well-posedness, extended well-posedness, and strongly extended well-posedness. Criteria and characterizations of the three types of extended well-posedness are established, generalizing most of the results obtained by Zolezzi for scalar optimization problems. Finally, a stronger vector variational principle and Palais-Smale type conditions are used to derive sufficient conditions for the three types of extended well-posedness.     

On approximate solutions in set-valued optimization problems

In this paper we introduce several concepts of approximate solutions of set-valued optimization problems with vector and set optimization. We prove existence results and necessary and sufficient conditions by using limit sets.     

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.     

Levitin-poyak well-posedness of generalized vector equilibrium problems with functional constraints

In this article, we study Levitin-Polyak type well-posedness for generalized vector equilibrium problems with abstract and functional constraints. Criteria and characterizations for these types of well-posednesses are given.     

Levitin–Polyak well-posedness of constrained vector optimization problems

In this paper, we consider Levitin–Polyak type well-posedness for a general constrained vector optimization problem. We introduce several types of (generalized) Levitin–Polyak well-posednesses. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. Finally, we consider convergence of a class of penalty methods under the assumption of a type of generalized Levitin–Polyak well-posedness.     

An optimization result for set-valued mappings and a stability property in vector problems with constraints

First, we prove an existence result relative to minimal points of set-valued mappings. Then, conditions about the upper and lower semicontinuity of constraint sets defined through set-valued mappings are given. Finally, a stability result relative to vector problems with abstract constraints is proved.The author thanks the referee for helpful comments on the first version of this paper.     

Conjugate dual problems in constrained set-valued optimization and applications

In this paper, two conjugate dual problems are proposed by considering the different perturbations to a set-valued vector optimization problem with explicit constraints. The weak duality, inclusion relations between the image sets of dual problems, strong duality and stability criteria are investigated. Some applications to so-called variational principles for a generalized vector equilibrium problem are shown.     

A pre-order principle and set-valued Ekeland variational principle

We establish a pre-order principle. From the principle, we obtain a very general set-valued Ekeland variational principle, where the objective function is a set-valued map taking values in a quasi-ordered linear space and the perturbation contains a family of set-valued maps satisfying certain property. From this general set-valued Ekeland variational principle, we deduce a number of particular versions of set-valued Ekeland variational principle, which include many known Ekeland variational principles, their improvements and some new results.