Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz

DOI10.1137/100786757zbMath1223.90072OpenAlexW2023247805MaRDI 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

zbMATH Keywords

disjunctive optimizationsymmetric Mangasarian-Fromovitz constraint qualificationclosure of feasible setgeneralized semi-infinite programming indexgeneralized semi-infinite programming, nonsmooth symmetric reduction ansatzLagrange polytopenondegenerate KKT point

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (4)

Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ How to solve a semi-infinite optimization problem ⋮ Optimality conditions for nonsmooth generalized semi-infinite programs ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems

This page was built for publication: Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz