Some new optimality conditions for semivector bilevel optimization program

DOI10.1080/02331934.2021.1873989MaRDI QIDQ5038162zbMATH OpenOpenAlexFDO

Authors Weihao Mao

Publication date 29 September 2022

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2021.1873989

zbMATH Keywords

bilevel optimizationoptimality conditiongap functionpenalty functionbasic subdifferential

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Recommendations

• Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
• New optimality conditions for the semivectorial bilevel optimization problem
• New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
• Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective
• Sufficient optimality conditions for a bilevel semivectorial D.C. problem

Cites work

• scientific article; zbMATH DE number 6167084 (Why is no real title available?)
• An equivalent one level optimization problem to a semivectorial bilevel problem
• Constrained extremum problems and image space analysis. I: Optimality conditions
• Constrained extremum problems and image space analysis. II: Duality and penalization
• Constrained extremum problems and image space analysis. III: Generalized systems
• Every closed convex set is the set of minimizers of some $C^{\infty }$-smooth convex function
• KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
• Necessary optimality conditions in pessimistic bilevel programming
• New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
• New optimality conditions for the semivectorial bilevel optimization problem
• On the numerical solution of a class of Stackelberg problems
• Optimality conditions for bilevel programming problems
• Optimality conditions for pessimistic semivectorial bilevel programming problems
• Semivectorial bilevel optimization problem: penalty approach
• Sensitivity analysis for two-level value functions with applications to bilevel programming
• Subdifferential formulae for the supremum of an arbitrary family of functions
• Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
• Theorems of the alternative and optimality conditions
• Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
• Variational analysis and applications
• Variational analysis of marginal functions with applications to bilevel programming

Cited in

(3)

• Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
• Estimates for coderivative of solution map in bilevel program
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case

This page was built for publication: Some new optimality conditions for semivector bilevel optimization program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038162)