Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 30, Issue 3, Pages 211-227Publisher
SPRINGER
DOI: 10.1007/s10589-005-4612-4
Keywords
bilevel programming; nonlinear programming; trust-region methods; approximation; numerical results
Ask authors/readers for more resources
We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, i.e., bilevel programs involving linear approximations of the upper-level objective and all constraint-defining functions, as well as a quadratic approximation of the lower-level objective. We describe the main features of the algorithm and the resulting software. Numerical experiments tend to confirm the promising behavior of the method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available