Applying directional upper semi-regular convexificators in bilevel optimization
From MaRDI portal
Publication:6092940
DOI10.1080/02331934.2022.2089036MaRDI QIDQ6092940FDOQ6092940
Authors: M. El Idrissi, Nazih Abderrazzak Gadhi, Mohamed Ohda 
Publication date: 23 November 2023
Published in: Optimization (Search for Journal in Brave)
Recommendations
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions for bilevel set optimization problems
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
bilevel optimizationoptimality conditionsoptimal value functiondirectional upper semi-regular convexificators
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Optimality conditions (49K99)
Cites Work
- Optimization and nonsmooth analysis
- New necessary optimality conditions in optimistic bilevel programming
- Multiobjective bilevel optimization
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality conditions for bilevel programming problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Convexifactors, generalized convexity and vector optimization
- Title not available (Why is that?)
- First-order necessary optimality conditions for general bilevel programming problems
- Convexificators and strong Kuhn-Tucker conditions
- Convexifactors, generalized convexity, and optimality conditions
- Some properties of the bilevel programming problem
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- On the numerical solution of a class of Stackelberg problems
- A note on optimality conditions for bilevel programming problems∗
- Necessary optimality conditions for Stackelberg problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- Necessary optimality conditions for bilevel set optimization problems
- Optimality conditions of a set valued optimization problem with the help of directional convexificators
- Necessary optimality conditions for a bilevel multiobjective programming problem via a \(\Psi\)-reformulation
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
Cited In (2)
This page was built for publication: Applying directional upper semi-regular convexificators in bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092940)
