Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz

The feasible set M in generalized semi-infinite programming (GSIP) need not be closed. Under the so-called symmetric Mangasarian-Fromovitz constraint qualification (Sym- MFCQ), its closure ... can be described by means of infinitely many inequality constraints of maximum type. This paper introduces...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on optimization 2011-01, Vol.21 (1), p.193-211
Hauptverfasser:	Jongen, H Th, Shikhman, V
Format:	Artikel
Sprache:	eng
Schlagworte:	Inequalities Lagrange multiplier Mathematical programming Optimization Programming Reduction Set theory Studies Symbols
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!