Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 695-711 |
| Number of pages | 17 |
| Journal | Numerical Functional Analysis and Optimization |
| Volume | 34 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 May 2013 |
Keywords
- Generalized Levitin-Polyak wellposedness
- Generalized semi-infinite programs
- Penalty methods
ASJC Scopus subject areas
- Analysis
- Signal Processing
- Computer Science Applications
- Control and Optimization
Fingerprint
Dive into the research topics of 'Generalized levitin-polyak well-posedness for generalized semi-infinite programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver