General semi-infinite programming: critical point theory

DOI10.1080/02331934.2010.543134zbMath1242.90271OpenAlexW1984449343MaRDI QIDQ3112491

Vladimir Shikhman, Hubertus Th. Jongen

Publication date: 10 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2010.543134

zbMATH Keywords

Morse theoryclosure feasible setGSIPsymmetric Mangasarian-Fromovitz constraint qualificationGSIP-indexnondegenerate KKT-pointnonsmooth symmetric reduction ansatz

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Related Items (3)

Critical point theory for sparse recovery ⋮ How to solve a semi-infinite optimization problem ⋮ On topological properties of min-max functions

Cites Work

• Generalized semi-infinite programming: a tutorial
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Disjunctive optimization: Critical point theory
• Bi-level strategies in semi-infinite programming.
• Global optimization: local minima and transition points
• Differential Topology

This page was built for publication: General semi-infinite programming: critical point theory