A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function

DOI10.1007/s10957-011-9831-5zbMath1250.90080OpenAlexW2028766715MaRDI QIDQ635806

Abdelmalek Aboussoror, Samir Adly

Publication date: 23 August 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9831-5

zbMATH Keywords

convex analysisconjugate dualitytwo-level optimizationcomposed programming problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong 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
• Conjugate duality in convex optimization
• Practical bilevel optimization. Algorithms and applications
• Existence and approximation results involving regularized constrained Stackelberg problems
• Weak linear bilevel programming problems: existence of solutions via a penalty method
• Conjugate duality for multiobjective composed optimization problems
• On the relations between different duals assigned to composed optimization problems
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• Bilevel programs with extremal value function: global optimality
• Duality in Vector Optimization
• An algorithm for solving two-level convex optimization problems
• Optimality conditions and algorithms for parameter design problems with two-level structure
• A simple algorithm for the-linear bilevel programming problem
• Existence theorems of equilibrium points in stackelberg
• Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization
• New necessary optimality conditions in optimistic bilevel programming
• Convex Analysis
• A solution method for the linear static Stackelberg problem using penalty functions