An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

DOI10.1137/16M1080896zbMath1432.90106MaRDI QIDQ5275295

Samir Adly, Abdelmalek Aboussoror, Fatima Ezzahra Saissi

Publication date: 11 July 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

conjugate dualitybilevel optimizationd.c. constraintsFenchel-Lagrange duality

Mathematics Subject Classification ID

Convex programming (90C25) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ A duality approach for a class of semivectorial bilevel programming problems

Cites Work

• A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Some new Farkas-type results for inequality systems with DC functions
• Strong duality for generalized convex optimization problems
• Duality for almost convex optimization problems via the perturbation approach
• Conjugate duality in convex optimization
• Sequential Stackelberg equilibria in two-person games
• Duality in D. C. programming: The case of several D. C. constraints
• Existence and approximation results involving regularized constrained Stackelberg problems
• Stability of regularized bilevel programming problems
• On the relations between different duals assigned to composed optimization problems
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
• Duality in Vector Optimization
• An algorithm for solving two-level convex optimization problems
• Convergences of marginal functions with dependent constraints
• semi-continuities of marginal functions in a sequential setting
• Convex Analysis
• Convex analysis and global optimization
• First-order necessary optimality conditions for general bilevel programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems