Applying directional upper semi-regular convexificators in bilevel optimization
From MaRDI portal
Publication:6092940
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
Cites work
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- A necessary and a sufficient optimality condition for bilevel programming problems
- A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- A note on optimality conditions for bilevel programming problems∗
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Convexifactors, generalized convexity and vector optimization
- Convexifactors, generalized convexity, and optimality conditions
- Convexificators and strong Kuhn-Tucker conditions
- First-order necessary optimality conditions for general bilevel programming problems
- Hunting for a smaller convex subdifferential
- Multiobjective bilevel optimization
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Necessary optimality conditions for Stackelberg problems
- Necessary optimality conditions for a bilevel multiobjective programming problem via a \(\Psi\)-reformulation
- 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
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- New necessary optimality conditions in optimistic bilevel programming
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On the numerical solution of a class of Stackelberg problems
- Optimality conditions for bilevel programming problems
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimality conditions of a set valued optimization problem with the help of directional convexificators
- Optimization and nonsmooth analysis
- Problems of Hierarchical Optimization in Finite Dimensions
- Some properties of the bilevel programming problem
- Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
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)
