On variational inequalities using directional convexificators

DOI10.1080/02331934.2021.1888088zbMath1503.90143OpenAlexW3129895277MaRDI QIDQ5039394

Nazih Abderrazzak Gadhi

Publication date: 12 October 2022

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationvariational inequalitiescontinuity directionsdirectional convexificators\(\partial_D^\ast\)-convexity

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Dynamic programming (90C39)

Related Items (max. 100)

Optimality conditions for MPECs in terms of directional upper convexifactors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
• On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials
• Nonsmooth vector optimization problems and Minty vector variational inequalities
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Quasidifferentiability and related topics. Dedicated to Prof. Franco Giannessi on his 65th birthday and to Prof. Diethard Pallaschke on his 60th birthday
• Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
• Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
• Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
• On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
• A non-smooth version of Minty variational principle
• Relationships Between Convexificators and Greenberg–Pierskalla Subdifferentials for Quasiconvex Functions
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
• Convexifactors, generalized convexity and vector optimization
• Optimality conditions of a set valued optimization problem with the help of directional convexificators
• Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
• Convexificators and necessary conditions for efficiency
• A note on Minty type vector variational inequalities

This page was built for publication: On variational inequalities using directional convexificators