Exact penalty method for the nonlinear bilevel programming problem
DOI10.1007/S11859-010-0686-7zbMATH Open1240.90393OpenAlexW2042390163MaRDI QIDQ3017403FDOQ3017403
Authors: Qingfei Pan, Zhonghua An, Hui Qi 
Publication date: 19 July 2011
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-010-0686-7
Recommendations
- A penalty function method for solving nonlinear-linear bilevel programming problem
- An exact penalty function method for solving a class of nonlinear bilevel programs
- A global convergent method for nonlinear bilevel programming problems
- An exact penalty method for weak linear bilevel programming problem
- An exact penalty function approach for solving the linear bilevel multiobjective programming problem
penalty function methodnonlinear bilevel programmingKuhn-Tucker optimality conditionconvex-quadratic programming
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)
Cites Work
- Practical bilevel optimization. Algorithms and applications
- A global optimization method for solving convex quadratic bilevel programming problems
- Foundations of bilevel programming
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- A solution method for the linear static Stackelberg problem using penalty functions
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Exact penalty functions for convex bilevel programming problems.
- On the definition of linear bilevel programming solution
- Double penalty method for bilevel optimization problems
- A penalty function method for solving inverse optimal value problem
- A study of local solutions in linear bilevel programming
- Theoretical and computational results for a linear bilevel problem
Cited In (13)
- \(\varepsilon\)-exact penalty for non-concave bilevel programming problems
- A penalty function method for solving nonlinear-linear bilevel programming problem
- Title not available (Why is that?)
- On penalty and gap function methods for bilevel equilibrium problems
- Exact penalty functions for convex bilevel programming problems.
- On penalty function method for a class of nonconvex constrained optimization problems.
- An exact penalty function method for solving a class of nonlinear bilevel programs
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- A global convergent method for nonlinear bilevel programming problems
- An exact penalty method for weak linear bilevel programming problem
- Frank-Wolfe method for solving a class of nonlinear bilevel programming problems
- A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: Exact penalty method for the nonlinear bilevel programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017403)
