A trust region algorithm for solving bilevel programming problems
From MaRDI portal
Publication:385180
DOI10.1007/s10255-013-0231-5zbMath1277.90101OpenAlexW1972004391MaRDI QIDQ385180
Guo-shan Liu, Ji-ye Han, Shi-qin Xu
Publication date: 2 December 2013
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-013-0231-5
global convergencestationary pointmathematical program with equilibrium constraintstrust region algorithmbilevel programming problem
Nonconvex programming, global optimization (90C26) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02)
Related Items (2)
Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- An SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A trust region algorithm for minimization of locally Lipschitzian functions
- Bilevel and multilevel programming: A bibliography review
- A trust region algorithm for nonlinear bilevel programming
- Foundations of bilevel programming
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Directional derivatives of the solution of a parametric nonlinear program
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Minimization of Locally Lipschitzian Functions
This page was built for publication: A trust region algorithm for solving bilevel programming problems
