Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz
From MaRDI portal
Publication:3004980
DOI10.1137/100786757zbMath1223.90072MaRDI QIDQ3004980
Vladimir Shikhman, Hubertus Th. Jongen
Publication date: 6 June 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100786757
disjunctive optimization; symmetric Mangasarian-Fromovitz constraint qualification; closure of feasible set; generalized semi-infinite programming index; generalized semi-infinite programming, nonsmooth symmetric reduction ansatz; Lagrange polytope; nondegenerate KKT point
90C34: Semi-infinite programming
Related Items
Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems, Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization, Optimality conditions for nonsmooth generalized semi-infinite programs, How to solve a semi-infinite optimization problem