Optimality Conditions for a Simple Convex Bilevel Programming Problem

DOI10.1007/978-1-4419-0437-9_7zbMath1220.90090MaRDI QIDQ2995267

No author found.

Publication date: 20 April 2011

Published in: Variational Analysis and Generalized Differentiation in Optimization and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-0437-9_7

zbMATH Keywords

regularity conditions; lower-level problem

Mathematics Subject Classification ID

90C25: Convex programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

Optimality conditions for the simple convex bilevel programming problem in Banach spaces, Necessary optimality conditions in pessimistic bilevel programming, Optimality conditions for mixed discrete bilevel optimization problems, Optimality conditions for pessimistic semivectorial bilevel programming problems, The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs, A duality approach for a class of semivectorial bilevel programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
• Inequality systems and global optimization
• Qualification and optimality conditions for dc programs with infinite constraints
• Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variational Inequalities
• Bilevel programming with convex lower level problems
• A closedness condition and its applications to DC programs with convex constraints
• Variational Analysis
• New necessary optimality conditions in optimistic bilevel programming
• New Farkas-type constraint qualifications in convex infinite programming
• Optimality conditions for bilevel programming problems