In this article, we study the generalized Levitin-Polyak well-posedness of generalized semi-infinite programs. We first give the criteria and characterizations for two types of well-posedness. We then establish the convergence of a class of penalty methods under the assumption of generalized type I Levitin-Polyak well-posedness.
- Generalized Levitin-Polyak wellposedness
- Generalized semi-infinite programs
- Penalty methods
ASJC Scopus subject areas
- Signal Processing
- Computer Science Applications
- Control and Optimization