2012 | OriginalPaper | Buchkapitel
General Semi-infinite Programming Problems
verfasst von : Vladimir Shikhman
Erschienen in: Topological Aspects of Nonsmooth Optimization
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study general semi-infinite programming problems (GSIP) from the topological point of view. Introducing the symmetric Mangasarian-Fromovitz constraint qualification (Sym-MFCQ) for GSIPs, we describe the closure of the GSIP feasible set. It is proved that Sym-MFCQ is stable and generic. Moreover, under Sym-MFCQ, the GSIP feasible set is shown to be a Lipschitz manifold. For GSIPs, we state the nonsmooth symmetric reduction ansatz (NSRA). NSRA is proven to hold generically at all KKT points for the GSIP. NSRA allows us to reduce the GSIP to a so-called disjunctive optimization problem. This reduction enables to establish the critical point theory for GSIPs.