Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming

DOI10.1137/S1052623403431500zbMath1114.90141OpenAlexW1968806261MaRDI QIDQ5317529

Francisco Guerra Vázquez, Jan-Joachim Rückmann

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623403431500

zbMATH Keywords

local minimizerextended Mangasarian-Fromovitz constraint qualificationgeneralized semi-infinite programmingKarush-Kuhn-Tucker theoremextended Abadie constraint qualificationextended Kuhn-Tucker constraint qualification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)

Related Items

Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Generalized semi-infinite programming: a tutorial ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ First order optimality conditions for generalized semi-infinite programming problems ⋮ Differential conditions for constrained nonlinear programming via Pareto optimization ⋮ ON FIRST-ORDER NECESSARY CONDITIONS FOR OPTIMALITY OF REGULAR GENERALIZED SEMI-INFINITE PROGRAMMING ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item