We address the minimization of an objective function over the solution set of a (non-parametric) lower-level variational inequality. This problem is a special instance of semi-infinite programs and encompasses, as particular cases, simple (smooth) bilevel and equilibrium selection problems. We resort to a suitable approximated version of the hierarchical problem. We show that this, on the one hand, does not perturb the original (exact) program ‘too much’, on the other hand, allows one to rely on some suitable exact penalty approaches whose convergence properties are established.
Bigi, G., Lampariello, L., & Sagratella, S. (2021). Combining approximation and exact penalty in hierarchical programming. OPTIMIZATION, 1-17.
|Titolo:||Combining approximation and exact penalty in hierarchical programming|
|Data di pubblicazione:||2021|
|Citazione:||Bigi, G., Lampariello, L., & Sagratella, S. (2021). Combining approximation and exact penalty in hierarchical programming. OPTIMIZATION, 1-17.|
|Appare nelle tipologie:||1.1 Articolo in rivista|