Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 15, Issue 2, Pages 145-166Publisher
SPRINGER
DOI: 10.1023/A:1008735010803
Keywords
bilevel programming; parametric optimization; bundle algorithm; nondifferentiable optimization
Ask authors/readers for more resources
In the paper, the question is investigated if a bundle algorithm can be used to compute approximate solutions for bilevel programming problems where the lower level optimal solution is in general not uniquely determined. To give a positive answer to this question, an appropriate regularization approach is used in the lower level. In the general case, the resulting algorithm computes an approximate solution. If the problem proves to have strongly stable lower level solutions for all parameter values in a certain neighborhood of the stationary solutions of the bilevel problem, convergence to stationary solutions can be shown.
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