A note on optimality conditions for bilevel programming problems∗

DOI10.1080/02331939708844290MaRDI QIDQ4340163zbMATH OpenOpenAlexFDO

Authors

Publication date 16 June 1997

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

bilevel programmingcondition numbercorrectionuniform weak sharp minimum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Optimality conditions for bilevel programming problems
• Weak Sharp Minima in Mathematical Programming

Cited in

(32)

• New uniform parametric error bounds
• On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
• Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
• Convexification method for bilevel programs with a nonconvex Follower's problem
• Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
• On solving simple bilevel programs with a nonconvex lower level program
• On calmness conditions in convex bilevel programming
• scientific article; zbMATH DE number 2185525 (Why is no real title available?)
• Optimality results for a specific bilevel optimization problem
• scientific article; zbMATH DE number 1382559 (Why is no real title available?)
• Optimality conditions for a bilevel matroid problem
• scientific article; zbMATH DE number 1559437 (Why is no real title available?)
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces
• scientific article; zbMATH DE number 4116318 (Why is no real title available?)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
• Constraint qualifications and optimality conditions in bilevel optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Directional necessary optimality conditions for bilevel programs
• New necessary optimality conditions in optimistic bilevel programming
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
• Optimality conditions for mixed discrete bilevel optimization problems
• Applying directional upper semi-regular convexificators in bilevel optimization
• Extension of the value function reformulation to multiobjective bilevel optimization
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Applying tangential subdifferentials in bilevel optimization
• Fuzzy and exact necessary optimality conditions for a nonsmooth bilevel semi-infinite program
• Approximate Karush-Kuhn-Tucker conditions for nonsmooth bilevel optimization problems
• Necessary optimality conditions for strictly robust bilevel optimization problems
• Optimality conditions for constrained minimax optimization
• Approximate KKT conditions for generalized bilevel optimization with a variational-inequality lower level
• A smoothing augmented Lagrangian method for solving simple bilevel programs
• Some properties of the bilevel programming problem

This page was built for publication: A note on optimality conditions for bilevel programming problems^∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340163)