First-order optimality conditions for Lipschitz optimization problems with vanishing constraints

DOI10.1007/S40995-020-00988-ZMaRDI QIDQ7232260zbMATH OpenFDO

Authors Hadis Mokhtavayi, Aghileh Heydari, Nader Kanzi

Publication date 22 April 2026

Published in Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40995-020-00988-Z

zbMATH Keywords

constraint qualificationoptimality conditionsstationary conditionsvanishing constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
• Exact penalty results for mathematical programs with vanishing constraints
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 2120969 (Why is no real title available?)
• Introduction to nonsmooth optimization. Theory, practice and software
• Mathematical programming with \((\Phi,\rho)\)-invexity
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
• Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
• On estimating the regular normal cone to constraint systems and stationarity conditions
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
• Optimality conditions for non-smooth semi-infinite programming
• Optimization and nonsmooth analysis
• Semi-infinite multiobjective programming with generalized invexity
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

This page was built for publication: First-order optimality conditions for Lipschitz optimization problems with vanishing constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232260)