The goal is to design, under the assumption of having access to an approximation of the lower-level minimizer, derivative-free methods in order to solve the upper-level. The focus is on optimization with constraints, both in the smooth and non-smooth case.

The goal is to design, under the assumption of having access to an approximation of the lower-level minimizer, derivative-free methods in order to solve the upper-level. The focus is on optimization with constraints, both in the smooth and non-smooth case.

A derivative-free method for bilevel optimization

BOJOVIC, MATIA
2022/2023

Abstract

The goal is to design, under the assumption of having access to an approximation of the lower-level minimizer, derivative-free methods in order to solve the upper-level. The focus is on optimization with constraints, both in the smooth and non-smooth case.
2022
A derivative-free method for bilevel optimization
The goal is to design, under the assumption of having access to an approximation of the lower-level minimizer, derivative-free methods in order to solve the upper-level. The focus is on optimization with constraints, both in the smooth and non-smooth case.
Bilevel programming
Derivative-free
Direct search
Lauree magistrali
File in questo prodotto:
File Dimensione Formato  
Bojovic_Matia.pdf

accesso aperto

Dimensione 1.06 MB
Formato Adobe PDF
Visualizza/Apri
1.06 MB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/61363