Bilevel optimization
Bilevel optimization is a special kind of optimization where one problem is embedded (nested) within another. The outer optimization task is commonly referred to as the upper-level optimization task, and the inner optimization task is commonly referred to as the lower-level optimization task. These problems involve two kinds of variables, referred to as the upper-level variables and the lower-level variables.
Bilevel optimization - Wikipedia Jump to content From Wikipedia, the free encyclopedia Quadratic fractional programming problem Bilevel optimization is a special kind of optimization where one problem is embedded (nested) within another. The outer optimization task is commonly referred to as the upper-level optimization task, and the inner optimization task is commonly referred to as the lower-level optimization task. These problems involve two kinds of variables, referred to as the upper-level variables and the lower-level variables. [ 1 ] [ 2 ] [ 3 ] Mathematical formulation of the problem [
related reading
- Mathematical optimization - Wikipediaen.wikipedia.org
- Pareto front - Wikipediaen.wikipedia.org
- Global optimization - Wikipediaen.wikipedia.org
- Multi-objective optimization - Wikipediaen.wikipedia.org
- bv_cvxbook.pdfweb.stanford.edu
- Hyperparameter optimization - Wikipediaen.wikipedia.org
- Knapsack problem - Wikipediaen.wikipedia.org
- Minimax - Wikipediaen.wikipedia.org
- Bayesian programming - Wikipediaen.wikipedia.org
- Barrier function - Wikipediaen.wikipedia.org
- Optimal stopping - Wikipediaen.wikipedia.org
- Introduction to Inverse Problemsstat.uchicago.edu