First- and second-order optimality conditions in optimistic bilevel set-valued programming

DOI10.1080/02331934.2020.1846189zbMath1495.90180OpenAlexW3105927661MaRDI QIDQ5090291

Lahoussine Lafhim

Publication date: 18 July 2022

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionsset-valued optimizationbilevel optimizationfirst- and second-order approximations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-order optimality conditions for \(C^1\) multiobjective programming problems
• First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces
• First and second-order optimality conditions without differentiability in multivalued vector optimization
• Second order optimality conditions for bilevel set optimization problems
• Existence theorems in vector optimization
• Contingent derivative of the perturbation map in multiobjective optimization
• Second-order optimality conditions in multiobjective optimization problems
• On the (non-)differentiability of the optimal value function when the optimal solution is unique
• Second-order optimality conditions for the extremal problem under inclusion constraints
• On the regularity condition for vector programming problems
• First- and second-order optimality conditions for multiobjective fractional programming
• Necessary optimality conditions for bilevel optimization problems using convexificators
• First-order optimality conditions in set-valued optimization
• Optimality Conditions Without Continuity in Multivalued Optimization Using Approximations as Generalized Derivatives
• Second Order Optimality Conditions for Problems with Continuously Differentiable Data
• On the numerical solution of a class of Stackelberg problems
• An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
• Optimization and nonsmooth analysis
• Numerical Optimization
• A necessary and a sufficient optimality condition for bilevel programming problems
• Second order approximations and dual necessary optimality conditions
• Stochastic Optimization Methods
• Optimality conditions for bilevel programming problems
• Sufficient Optimality Conditions in Bilevel Programming
• Approximations and Metric Regularity in Mathematical Programming in Banach Space
• Set-valued Optimization
• Convex Analysis
• Set-valued analysis
• Optimality conditions for \(C^{1,1}\) vector optimization problems

This page was built for publication: First- and second-order optimality conditions in optimistic bilevel set-valued programming