Some new optimality conditions for semivector bilevel optimization program
From MaRDI portal
Publication:5038162
DOI10.1080/02331934.2021.1873989OpenAlexW3121800208MaRDI QIDQ5038162
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
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (1)
Cites Work
- Unnamed Item
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- Variational analysis of marginal functions with applications to bilevel programming
- 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
- An equivalent one level optimization problem to a semivectorial bilevel problem
- Theorems of the alternative and optimality conditions
- New optimality conditions for the semivectorial bilevel optimization problem
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
- Semivectorial bilevel optimization problem: penalty approach
- On the numerical solution of a class of Stackelberg problems
- Every closed convex set is the set of minimizers of some $C^{\infty }$-smooth convex function
- Variational Analysis and Applications
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- Optimality conditions for bilevel programming problems
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- Necessary optimality conditions in pessimistic bilevel programming
- Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
This page was built for publication: Some new optimality conditions for semivector bilevel optimization program
