caa a22 4500 475750705 CHVBK 20180406123522.0 cr unu---uuuuu 170329e20000201xx s 000 0 eng 10.1023/A:1008735010803 doi (NATIONALLICENCE)springer-10.1023/A:1008735010803 Dempe S. Freiberg University of Mining and Technology, Freiberg, Germany aut A Bundle Algorithm Applied to Bilevel Programming Problems with Non-Unique Lower Level Solutions [Elektronische Daten] [S. Dempe] 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. Kluwer Academic Publishers, 2000 bilevel programming nationallicence parametric optimization nationallicence bundle algorithm nationallicence nondifferentiable optimization nationallicence Computational Optimization and Applications Kluwer Academic Publishers 15/2(2000-02-01), 145-166 0926-6003 15:2<145 2000 15 10589 https://doi.org/10.1023/A:1008735010803 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1008735010803 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Dempe S. Freiberg University of Mining and Technology, Freiberg, Germany aut NATIONALLICENCE 773 0- Computational Optimization and Applications Kluwer Academic Publishers 15/2(2000-02-01), 145-166 0926-6003 15:2<145 2000 15 10589 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer