Exact penalty functions for convex bilevel programming problems.
From MaRDI portal
Publication:5958092
DOI10.1023/A:1017592429235zbMath1064.90045OpenAlexW175969631MaRDI QIDQ5958092
Ji-ye Han, Guo-shan Liu, Zhang, Jianzhong
Publication date: 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017592429235
constraint qualificationsBilevel programming problemsexact penalty functionspartial calmnessreformulations
Related Items
An objective penalty method for optimistic bilevel programming problems ⋮ Optimal design of brittle composite materials: a nonsmooth approach ⋮ An objective penalty function of bilevel programming ⋮ A quadratic objective penalty function for bilevel programming ⋮ Exact penalty method for the nonlinear bilevel programming problem ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ Monotonicity of Optimal Contracts Without the First-Order Approach ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Some properties of the bilevel programming problem
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- A global optimization approach for the linear two-level program
- A smoothing method for mathematical programs with equilibrium constraints
- Necessary optimality conditions for Stackelberg problems
- Descent approaches for quadratic bilevel programming
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A numerical approach to optimization problems with variational inequality constraints
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Weak via strong Stackelberg problem: New results
- On bilevel programming. I: General nonlinear cases
- Bilevel linear programming
- Directional derivative of the marginal function in nonlinear programming
- Calmness and Exact Penalization
- Optimization and nonsmooth analysis
- Exact Penalties for Local Minima
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- An Exact Penalization Viewpoint of Constrained Optimization
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- On Optimization Problems with Variational Inequality Constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- A necessary and a sufficient optimality condition for bilevel programming problems
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:1$f:1partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments
- Optimality conditions for bilevel programming problems
- A solution method for the linear static Stackelberg problem using penalty functions
- Mathematical Programs with Equilibrium Constraints
