Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem

DOI10.1080/01630563.2018.1488141zbMath1431.90140OpenAlexW2895358455MaRDI QIDQ4622791

Nazih Abderrazzak Gadhi, Stephan Dempe

Publication date: 18 February 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

multi-objective optimizationconvex functionssufficient optimality conditionsbi-level optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions (49K99)

Related Items (max. 100)

Methods for Multiobjective Bilevel Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smoothing method for solving bilevel multiobjective programming problems
• Some properties of the bilevel programming problem
• Necessary optimality conditions for Stackelberg problems
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• A multivariate partition approach to optimization problems
• Kolmogorov conditions for vectorial optimization problems
• New optimality conditions for the semivectorial bilevel optimization problem
• Semivectorial bilevel optimization problem: penalty approach
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Necessary Optimality Conditions for Multiobjective Bilevel Programs
• Optimization and nonsmooth analysis
• Clarke's tangent cones and the boundaries of closed sets in Rn
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• A formula on the approximate subdifferential of the difference of convex functions
• On Optimization Problems with Variational Inequality Constraints
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• A necessary and a sufficient optimality condition for bilevel programming problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Local search in problems with nonconvex constraints
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• First-order necessary optimality conditions for general bilevel programming problems
• Simplified optimality conditions for minimizing the difference of vector-valued functions

This page was built for publication: Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem