Disjunctive optimization: critical point theory
Journal of Optimization Theory and Applications
Generalized semi-infinite optimization: a first order optimality condition and examples
Mathematical Programming: Series A and B
One-Parameter Families of Feasible Sets in Semi-infinite Optimization
Journal of Global Optimization
BI-Level Strategies in Semi-Infinite Programming
BI-Level Strategies in Semi-Infinite Programming
Nonlinear Optimization in Finite Dimensions - Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects (Nonconvex Optimization and its Applications Volume 47)
Generalized semi-infinite programming: A tutorial
Journal of Computational and Applied Mathematics
Generalized Semi-Infinite Programming: on generic local minimizers
Journal of Global Optimization
Necessary optimality conditions for nonsmooth semi-infinite programming problems
Journal of Global Optimization
Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz
SIAM Journal on Optimization
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
Computational Optimization and Applications
Hi-index | 0.00 |
The feasible set $M$ in general semi-infinite programming (GSIP) need not be closed. This fact is well known. We introduce a natural constraint qualification, called symmetric Mangasarian-Fromovitz constraint qualification (Sym-MFCQ). The Sym-MFCQ is a nontrivial extension of the well-known (extended) MFCQ for the special case of semi-infinite programming (SIP) and disjunctive programming. Under the Sym-MFCQ the closure $\overline{M}$ has an easy and also natural description. As a consequence, we get a description of the interior and boundary of $M$. The Sym-MFCQ is shown to be generic and stable under $C^1$-perturbations of the defining functions. For the latter stability the consideration of the closure of $M$ is essential. We introduce an appropriate notion of Karush-Kuhn-Tucker (KKT) points. We show that local minimizers are KKT points under the Sym-MFCQ.