Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386): Difference between revisions

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.

0 references

reviewed by

Antanas Žilinskas

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

bilevel programming

0 references

convexification

0 references

constraint qualification

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-011-9941-0

0 references

OpenAlex ID

W2053072311

0 references

cites work

Practical bilevel optimization. Algorithms and applications

0 references

Foundations of bilevel programming

0 references

Optimality conditions for the bilevel programming problem

0 references

Some properties of the bilevel programming problem

0 references

A necessary and a sufficient optimality condition for bilevel programming problems

0 references

First-order necessary optimality conditions for general bilevel programming problems

0 references

Necessary optimality conditions for Stackelberg problems

0 references

Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints

0 references

Optimality conditions for bilevel programming problems

0 references

First-order necessary optimality conditions for general bilevel programming problems

0 references

Necessary optimality conditions for bilevel optimization problems using convexificators

0 references

New necessary optimality conditions in optimistic bilevel programming

0 references

Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems

0 references

Constraint Qualifications and KKT Conditions for Bilevel Programming Problems

0 references

Necessary optimality conditions in terms of convexificators in Lipschitz optimization

0 references

Q5574526

0 references

Hunting for a smaller convex subdifferential

0 references

Nonsmooth calculus, minimality, and monotonicity of convexificators

0 references

Convexifactors, generalized convexity, and optimality conditions

0 references

Convexifactors, generalized convexity and vector optimization

0 references

Q3704489

0 references

Variational Stability and Marginal Functions via Generalized Differentiation

0 references

Subgradients of marginal functions in parametric mathematical programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:415386

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10957-011-9941-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2053072311
@@ Property / OpenAlex ID: W2053072311 / rank @@
+Normal rank
@@ Property / cites work @@
+Practical bilevel optimization. Algorithms and applications
+Normal rank
@@ Property / cites work @@
+Foundations of bilevel programming
@@ Property / cites work: Foundations of bilevel programming / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality conditions for the bilevel programming problem
+Normal rank
@@ Property / cites work @@
+Some properties of the bilevel programming problem
+Normal rank
@@ Property / cites work @@
+A necessary and a sufficient optimality condition for bilevel programming problems
+Normal rank
@@ Property / cites work @@
+First-order necessary optimality conditions for general bilevel programming problems
+Normal rank
@@ Property / cites work @@
+Necessary optimality conditions for Stackelberg problems
+Normal rank
@@ Property / cites work @@
+Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
+Normal rank
@@ Property / cites work @@
+Optimality conditions for bilevel programming problems
+Normal rank
@@ Property / cites work @@
+First-order necessary optimality conditions for general bilevel programming problems
+Normal rank
@@ Property / cites work @@
+Necessary optimality conditions for bilevel optimization problems using convexificators
+Normal rank
@@ Property / cites work @@
+New necessary optimality conditions in optimistic bilevel programming
+Normal rank
@@ Property / cites work @@
+Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
+Normal rank
@@ Property / cites work @@
+Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
+Normal rank
@@ Property / cites work @@
+Necessary optimality conditions in terms of convexificators in Lipschitz optimization
+Normal rank
@@ Property / cites work @@
+Q5574526
@@ Property / cites work: Q5574526 / rank @@
+Normal rank
@@ Property / cites work @@
+Hunting for a smaller convex subdifferential
@@ Property / cites work: Hunting for a smaller convex subdifferential / rank @@
+Normal rank
@@ Property / cites work @@
+Nonsmooth calculus, minimality, and monotonicity of convexificators
+Normal rank
@@ Property / cites work @@
+Convexifactors, generalized convexity, and optimality conditions
+Normal rank
@@ Property / cites work @@
+Convexifactors, generalized convexity and vector optimization
+Normal rank
@@ Property / cites work @@
+Q3704489
@@ Property / cites work: Q3704489 / rank @@
+Normal rank
@@ Property / cites work @@
+Variational Stability and Marginal Functions via Generalized Differentiation
+Normal rank
@@ Property / cites work @@
+Subgradients of marginal functions in parametric mathematical programming
+Normal rank