Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem

DOI10.1080/02331934.2020.1750610zbMath1453.90138OpenAlexW3015956618MaRDI QIDQ5131829

Nazih Abderrazzak Gadhi, M. El Idrissi, Stephan Dempe

Publication date: 9 November 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1750610

zbMATH Keywords

optimality conditionsoptimal value functionbilevel optimizationconvexificatorsguignard constraint qualification

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Optimality conditions (49K99)

Related Items

Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints

Cites Work

• Unnamed Item
• Unnamed Item
• On the solution of convex bilevel optimization problems
• Solving ill-posed bilevel programs
• Optimality conditions for optimistic bilevel programming problem using convexifactors
• Variational analysis of marginal functions with applications to bilevel programming
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Optimality and duality results for bilevel programming problem using convexifactors
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Convexifactors, generalized convexity, and optimality conditions
• Subgradients of marginal functions in parametric mathematical programming
• Second order optimality conditions for bilevel set optimization problems
• Existence theorems in vector optimization
• A generalized derivative for calm and stable functions
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Practical bilevel optimization. Algorithms and applications
• Necessary optimality conditions for Stackelberg problems
• Hunting for a smaller convex subdifferential
• Foundations of bilevel programming
• New optimality conditions for the semivectorial bilevel optimization problem
• Necessary Optimality Conditions for Multiobjective Bilevel Programs
• Optimality conditions for the bilevel programming problem
• Optimization and nonsmooth analysis
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Variational Analysis and Applications
• Small convex-valued subdifferentials in mathematical programming
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Semivectorial bilevel programming versus scalar bilevel programming
• Variational Stability and Marginal Functions via Generalized Differentiation
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• New necessary optimality conditions in optimistic bilevel programming

This page was built for publication: Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem