General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
From MaRDI portal
Publication:3083297
DOI10.1137/090775294zbMath1229.90244OpenAlexW2054461902MaRDI QIDQ3083297
Vladimir Shikhman, Hubertus Th. Jongen, Francisco Guerra Vázquez
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090775294
semi-infinite programmingGSIPsymmetric Mangasarian-Fromovitz constraint qualificationKKT pointclosure of feasible set
Related Items (10)
Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ How to solve a semi-infinite optimization problem ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ On topological properties of min-max functions ⋮ Optimality conditions for nonsmooth generalized semi-infinite programs
This page was built for publication: General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
