Levenberg–Marquardt method and partial exact penalty parameter selection in bilevel optimization

We consider the optimistic bilevel optimization problem, known to have a wide range of applications in engineering, that we transform into a single-level optimization problem by means of the lower-level optimal value function reformulation. Subsequently, based on the partial calmness concept, we bui...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization and engineering Jg. 24; H. 2; S. 1343 - 1385
Hauptverfasser: Tin, Andrey, Zemkoho, Alain B.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.06.2023
Schlagworte:
Control
Engineering
Environmental Management
Financial Engineering
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Research Article
Systems Theory
Partial exact penalization parameter
Bilevel optimization
Partial calmness
Levenberg-Marquardt method
Value function reformulation
ISSN:1389-4420, 1573-2924
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the optimistic bilevel optimization problem, known to have a wide range of applications in engineering, that we transform into a single-level optimization problem by means of the lower-level optimal value function reformulation. Subsequently, based on the partial calmness concept, we build an equation system, which is parameterized by the corresponding partial exact penalization parameter. We then design and analyze a Levenberg–Marquardt method to solve this parametric system of equations. Considering the fact that the selection of the partial exact penalization parameter is a critical issue when numerically solving a bilevel optimization problem by means of the value function reformulation, we conduct a careful experimental study to this effect, in the context of the Levenberg–Marquardt method, while using the Bilevel Optimization LIBrary (BOLIB) series of test problems. This study enables the construction of some safeguarding mechanisms for practical robust convergence of the method and can also serve as base for the selection of the penalty parameter for other bilevel optimization algorithms. We also compare the Levenberg–Marquardt method introduced in this paper to other existing algorithms of similar nature.
ISSN:1389-4420
1573-2924
DOI:10.1007/s11081-022-09736-1