Extension of the value function reformulation to multiobjective bilevel optimization
From MaRDI portal
Abstract: We consider a multiobjective bilevel optimization problem with vector-valued upper- and lower-level objective functions. Such problems have attracted a lot of interest in recent years. However, so far, scalarization has appeared to be the main approach used to deal with the lower-level problem. Here, we utilize the concept of frontier map that extends the notion of optimal value function to our parametric multiobjective lower-level problem. Based on this, we build a tractable constraint qualification that we use to derive necessary optimality conditions for the problem. Subsequently, we show that our resulting necessary optimality conditions represent a natural extension from standard optimistic bilevel programs with scalar objective functions.
Recommendations
- Notes on the value function approach to multiobjective bilevel optimization
- Optimality of bilevel programming problems through multiobjective reformulations
- Optimality conditions for bilevel multiobjective programs
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
Cites work
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- A note on optimality conditions for bilevel programming problems∗
- Bilevel optimization. Advances and next challenges
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- Convex Analysis
- Estimates of generalized hessians for optimal value functions in mathematical programming
- Gauss-Newton-type methods for bilevel optimization
- Methods for Multiobjective Bilevel Optimization
- Necessary conditions for super minimizers in constrained multiobjective optimization
- New necessary optimality conditions in optimistic bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- New uniform parametric error bounds
- Nonsingularity conditions for multifunctions
- On approximate solutions of infinite systems of linear inequalities
- On calmness conditions in convex bilevel programming
- On the Calmness of a Class of Multifunctions
- Optimality conditions for bilevel programming problems
- Optimality conditions for the semivectorial bilevel optimization problem
- R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Semivectorial bilevel programming versus scalar bilevel programming
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Sensitivity analysis in multiobjective optimization
- Sensitivity analysis of gap functions for vector variational inequality via coderivatives
- Sensitivity analysis of parametric vector set-valued optimization problems via coderivatives
- Solving ill-posed bilevel programs
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
Cited in
(3)
This page was built for publication: Extension of the value function reformulation to multiobjective bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110627)
