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

DOI10.1007/S10957-011-9831-5MaRDI QIDQ635806zbMATH OpenOpenAlexFDO

Authors 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 analysistwo-level optimizationconjugate dualitycomposed programming problems

Mathematics Subject Classification ID

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

Recommendations

• An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
• scientific article; zbMATH DE number 6531256
• Optimality and duality results for bilevel programming problem using convexifactors
• scientific article; zbMATH DE number 1931010
• A duality approach for a class of semivectorial bilevel programming problems

Cites work

• scientific article; zbMATH DE number 3606241 (Why is no real title available?)
• scientific article; zbMATH DE number 978735 (Why is no real title available?)
• scientific article; zbMATH DE number 2096862 (Why is no real title available?)
• A simple algorithm for the-linear bilevel programming problem
• A solution method for the linear static Stackelberg problem using penalty functions
• An algorithm for solving two-level convex optimization problems
• Bilevel programs with extremal value function: global optimality
• Conjugate duality for multiobjective composed optimization problems
• Conjugate duality in convex optimization
• Convex Analysis
• Duality in Vector Optimization
• Existence and approximation results involving regularized constrained Stackelberg problems
• Existence theorems of equilibrium points in stackelberg
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• New necessary optimality conditions in optimistic bilevel programming
• On the relations between different duals assigned to composed optimization problems
• Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization
• Optimality conditions and algorithms for parameter design problems with two-level structure
• Practical bilevel optimization. Algorithms and applications
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Weak linear bilevel programming problems: existence of solutions via a penalty method

Cited in

(10)

• A duality approach for a class of semivectorial bilevel programming problems
• Sequential Pareto subdifferential multi-composition rule and application to multiobjective minimax location problems
• An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
• scientific article; zbMATH DE number 6531256 (Why is no real title available?)
• scientific article; zbMATH DE number 1931010 (Why is no real title available?)
• scientific article; zbMATH DE number 7668281 (Why is no real title available?)
• Conjugate duality and optimal properties of value-type bilevel linear programming problem
• Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme

This page was built for publication: A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function

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