A simple approach to optimality conditions in minmax programming

DOI10.1080/02331934.2011.653788zbMath1286.49022OpenAlexW2084580047MaRDI QIDQ5413892

Alain B. Zemkoho

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convexityoptimality conditionsoptimal value functionminmax programmingbasic subdifferentialsemicontinuous set-valued mappinginner semicompact set-valued mapping

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35)

Related Items (1)

Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs

Cites Work

• Variational analysis of marginal functions with applications to bilevel programming
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Subgradients of marginal functions in parametric mathematical programming
• Farkas' theorem of nonconvex type and its application to a min-max problem
• Necessary conditions and sufficient conditions for static minmax problems
• Necessary conditions in nonsmooth minimization via lower and upper subgradients
• Approximate optimality conditions for minimax programming problems
• Variational Analysis
• Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
• Variational Stability and Marginal Functions via Generalized Differentiation
• New necessary optimality conditions in optimistic bilevel programming

This page was built for publication: A simple approach to optimality conditions in minmax programming