Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators
DOI10.1080/02331934.2021.2016752zbMATH Open1528.90198OpenAlexW4200081175MaRDI QIDQ6042231FDOQ6042231
Authors: Lahoussine Lafhim, El Mostafa Kalmoun 
Publication date: 16 May 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.2016752
Recommendations
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimality conditions for MPECs in terms of directional upper convexifactors
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Optimality conditions for nonsmooth equilibrium problems via Hadamard directional derivative
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
equilibrium constraintsnonsmooth optimizationoptimality conditionsconstraint qualificationdirectional convexificator
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Optimization and nonsmooth analysis
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Quasiconvex programming with locally starshaped constraint region and applications to quasiconvex MPEC
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
- A Fritz John Approach to First Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
- Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators
Cited In (6)
- A note on the paper “Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints”
- On quasidifferentiable mathematical programs with equilibrium constraints
- Optimality conditions for MPECs in terms of directional upper convexifactors
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Optimality conditions for mathematical programs with orthogonality type constraints
- Aggregative variational inequalities
This page was built for publication: Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042231)
