Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints (Q415427): Difference between revisions

This paper presents Levitin-Polyak well-posedness of parametric generalized equilibrium problems and optimization problems with generalized equilibrium constraints. Characterizations for these types of Levitin-Polyak well-posedness are derived. In particular, the authors show that under suitable assumptions, generalized Levitin-Polyak well-posedness of a parametric generalized equilibrium problem is equivalent to the nonemptiness and compactness of its solution set. In particular, it is shown that, under suitable assumptions, Levitin-Polyak well-posedness of an optimization problem with generalized equilibrium constraints is equivalent to the nonemptiness and compactness of its solution set. Like the role of Levitin-Polyak well-posedness in convergence analysis of penalty type methods for ordinary constrained optimization, the study of Levitin-Polyak well-posedness for mathematical programs with equilibrium constraints (MPEC) problems should be useful to convergence analysis of penalty type methods for MPEC problems.