Extension of the value function reformulation to multiobjective bilevel optimization
From MaRDI portal
Publication:6110627
DOI10.1007/s11590-022-01948-9zbMath1527.90176arXiv2111.07522OpenAlexW3214700681MaRDI QIDQ6110627
Alain B. Zemkoho, Lahoussine Lafhim
Publication date: 6 July 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07522
optimality conditionscoderivativefrontier mapmultiobjective bilevel optimizationstrong domination property
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Optimality conditions (49K99)
Cites Work
- Unnamed Item
- Unnamed Item
- Solving ill-posed bilevel programs
- Sensitivity analysis of parametric vector set-valued optimization problems via coderivatives
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- Sensitivity analysis in multiobjective optimization
- On approximate solutions of infinite systems of linear inequalities
- New uniform parametric error bounds
- Nonsingularity conditions for multifunctions
- New optimality conditions for the semivectorial bilevel optimization problem
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
- Estimates of generalized hessians for optimal value functions in mathematical programming
- Bilevel optimization. Advances and next challenges
- Necessary conditions for super minimizers in constrained multiobjective optimization
- On calmness conditions in convex bilevel programming
- A note on optimality conditions for bilevel programming problems∗
- On the Calmness of a Class of Multifunctions
- Optimality conditions for bilevel programming problems
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- Methods for Multiobjective Bilevel Optimization
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Semivectorial bilevel programming versus scalar bilevel programming
- New necessary optimality conditions in optimistic bilevel programming
- Sensitivity analysis of gap functions for vector variational inequality via coderivatives
- Convex Analysis
This page was built for publication: Extension of the value function reformulation to multiobjective bilevel optimization