Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints

DOI10.1007/s10957-018-1373-7zbMath1402.90206OpenAlexW2886625034WikidataQ129392468 ScholiaQ129392468MaRDI QIDQ1626527

Sajjad Kazemi, Nader Kanzi

Publication date: 27 November 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1373-7

zbMATH Keywords

optimality conditionsconstraint qualificationvanishing constraintsstationary conditions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items (12)

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints ⋮ Necessary and sufficient conditions for M-stationarity of nonsmooth optimization problems with vanishing constraints ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints ⋮ Stationarity Condition for Nonsmooth MPVCs with Constraint Set ⋮ Unnamed Item ⋮ Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints ⋮ Unnamed Item ⋮ Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative

Uses Software

• GradSamp

Cites Work

• Unnamed Item
• Unnamed Item
• On duality for mathematical programs with vanishing constraints
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
• Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
• Optimization tools for solving equilibrium problems with nonsmooth data
• Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
• Exact penalty results for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Nonsmooth semi-infinite programming problems with mixed constraints
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
• Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Optimization and nonsmooth analysis
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• Optimization and equilibrium problems with equilibrium constraints in infinite-dimensional spaces
• Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
• Approximating Subdifferentials by Random Sampling of Gradients

This page was built for publication: Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints