Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints

DOI10.1007/s11228-009-0103-6zbMath1191.90070OpenAlexW2025451649MaRDI QIDQ833010

Nooshin Movahedian, Soghra Nobakhtian

Publication date: 11 August 2009

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-009-0103-6

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (13)

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians ⋮ On Abadie constraint qualification for multiobjective optimization problems ⋮ Unnamed Item ⋮ Scaled constraint qualifications for generalized equation constrained problems and application to nonsmooth mathematical programs with equilibrium constraints ⋮ Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators ⋮ Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ On quasidifferentiable mathematical programs with equilibrium constraints ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ Duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ A new Abadie-type constraint qualification for general optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Finite-dimensional optimality conditions: B-gradients
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Generalized differential calculus for nonsmooth and set-valued mappings
• Convex analysis and nonlinear optimization. Theory and examples
• A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
• On concepts of directional differentiability
• Abadie-type constraint qualification for mathematical programs with equilibrium constraints
• On M-stationary points for mathematical programs with equilibrium constraints
• Calmness of constraint systems with applications
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• Optimization and nonsmooth analysis
• Shrinking generalized gradients
• Some continuity properties of polyhedral multifunctions
• Lipschitzian stability of constraint systems and generalized equations
• Variational Analysis
• A Generalized Mathematical Program with Equilibrium Constraints
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• On the Calmness of a Class of Multifunctions
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints

This page was built for publication: Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints