Necessary optimality conditions for bilevel optimization problems using convexificators
From MaRDI portal
Recommendations
- Necessary optimality conditions for bilevel set optimization problems
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
Cites work
- A multivariate partition approach to optimization problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Approximate subdifferentials and applications 3: the metric theory
- First-order necessary optimality conditions for general bilevel programming problems
- Hunting for a smaller convex subdifferential
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On Optimization Problems with Variational Inequality Constraints
- On Subdifferentials of Optimal Value Functions
- On the mean value theorem
- On the regularity condition for vector programming problems
- On the variational principle
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Problems of Hierarchical Optimization in Finite Dimensions
- Regularity and stability for the mathematical programming problem in Banach spaces
- Second order approximations and dual necessary optimality conditions
- Small convex-valued subdifferentials in mathematical programming
- Some properties of the bilevel programming problem
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Cited in
(42)- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- First- and second-order optimality conditions in optimistic bilevel set-valued programming
- New necessary optimality conditions in optimistic bilevel programming
- Necessary optimality conditions for bilevel set optimization problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Applying convexificators in nonsmooth multiobjective semi-infinite fractional interval-valued optimization
- scientific article; zbMATH DE number 4159489 (Why is no real title available?)
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints
- An equivalent one level optimization problem to a semivectorial bilevel problem
- Second order optimality conditions for bilevel set optimization problems
- Efficiency conditions for multiobjective bilevel programming problems via convexificators
- Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
- A review of recent advances in global optimization
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- On interval-valued bilevel optimization problems using upper convexificators
- A new equivalent single-level problem for bilevel problems
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Applying directional upper semi-regular convexificators in bilevel optimization
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
- Optimality conditions for bilevel programming problems
- Fuzzy and exact optimality conditions for a bilevel set-valued problem via extremal principles
- Optimality conditions for mixed discrete bilevel optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Necessary optimality conditions for a bilevel multiobjective programming problem via a -reformulation
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Applying convexificators in robust multiobjective optimization
- Sufficient optimality conditions for a bilevel semivectorial D.C. problem
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
- Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians
- New optimality conditions for bilevel programs by using an exact separation principle
- Optimality and duality results for bilevel programming problem using convexifactors
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
- Optimality results for a specific bilevel optimization problem
- On multiobjective bilevel optimization using tangential subdifferentials
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
This page was built for publication: Necessary optimality conditions for bilevel optimization problems using convexificators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494307)
