A duality approach and optimality conditions for simple convex bilevel programming problems

MaRDI QIDQ5144467zbMATH OpenFDO

Authors Abdelmalek Aboussoror, Samir Adly

Publication date 16 January 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol13/pjov13n1p123.pdf

zbMATH Keywords

bilevel optimizationconjugate dualityconvex analysisoptimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Optimality Conditions for a Simple Convex Bilevel Programming Problem
• An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces
• scientific article; zbMATH DE number 7313928
• New necessary and sufficient optimality conditions for strong bilevel programming problems

Cited in

(8)

• Stability of regularized bilevel programming problems
• On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
• On solving simple bilevel programs with a nonconvex lower level program
• Bilevel programming problems with simple convex lower level
• Optimality Conditions for a Simple Convex Bilevel Programming Problem
• scientific article; zbMATH DE number 6531256 (Why is no real title available?)
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces
• Solution of bilevel optimization problems using the KKT approach

This page was built for publication: A duality approach and optimality conditions for simple convex bilevel programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144467)