Optimality conditions for optimistic bilevel programming problem using convexifactors
From MaRDI portal
A bilevel mathematical programming problem is considered with a convex lower-level problem. New Karush-Kuhn-Tucker type necessary optimality conditions are established. The proof is based on the concept of convexification, and on an upper estimate of the Clark subdifferential of the value function.
Recommendations
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality and duality results for bilevel programming problem using convexifactors
- New necessary optimality conditions in optimistic bilevel programming
Cites work
- A necessary and a sufficient optimality condition for bilevel programming problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Convexifactors, generalized convexity and vector optimization
- Convexifactors, generalized convexity, and optimality conditions
- First-order necessary optimality conditions for general bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
- Foundations of bilevel programming
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- Hunting for a smaller convex subdifferential
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Necessary optimality conditions for Stackelberg problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- New necessary optimality conditions in optimistic bilevel programming
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Optimality conditions for bilevel programming problems
- Optimality conditions for the bilevel programming problem
- Optimization and nonsmooth analysis
- Practical bilevel optimization. Algorithms and applications
- Some properties of the bilevel programming problem
- Subgradients of marginal functions in parametric mathematical programming
- Variational Stability and Marginal Functions via Generalized Differentiation
Cited in
(33)- Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
- A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Necessary and sufficient conditions for efficiency via convexificators
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
- On multiobjective bilevel optimization using tangential subdifferentials
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- A cutting plane approach for solving linear bilevel programming problems
- Variational inequalities and optimistic bilevel programming problem via convexifactors
- scientific article; zbMATH DE number 1091401 (Why is no real title available?)
- Optimality conditions for bilevel programming: an approach through variational analysis
- Necessary optimality conditions for a bilevel multiobjective programming problem via a -reformulation
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Efficiency conditions for multiobjective bilevel programming problems via convexificators
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Applying directional upper semi-regular convexificators in bilevel optimization
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality and duality results for bilevel programming problem using convexifactors
- First and second order optimality conditions using approximations for fractional multiobjective bilevel problems under fractional constraints
- On the partial calmness condition for an interval-valued bilevel optimization problem
- Necessary optimality conditions for nonsmooth multiobjective bilevel programs using the Drummond-Svaiter functional
- Optimality conditions for nondifferentiable interval-valued bilevel optimization problems via tangential subdifferentials
- Necessary optimality conditions for a bilevel multiobjective problem in terms of approximations
- Some calculus rules, generalized convexity via convexifactors and their applications
- Optimality conditions for nonsmooth vector interval-valued bilevel optimization problems in terms of tangential subdifferentials
- On multiobjective optimization and approximate vector variational inequalities using directional convexificators
- Optimality conditions for pessimistic bilevel problems using convexificator
- Necessary optimality conditions for bilevel set optimization problems
This page was built for publication: Optimality conditions for optimistic bilevel programming problem using convexifactors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415386)
