On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints

DOI10.2298/YJOR180615018NMaRDI QIDQ3388438zbMATH OpenWikidataFDO

Authors Triloki Nath, Abeka Khare

Publication date 5 May 2021

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.00632

zbMATH Keywords

constraint qualificationsenhanced Fritz John conditionserror boundmathematical programs with vanishing constraints

Mathematics Subject Classification ID

Numerical methods based on necessary conditions (49M05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Abstract: In this paper, the mathematical programs with vanishing constraints or MPVC are considered. We prove that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification. Most importantly, this constraint qualification is shown to be strictly stronger than MPVC-Abadie constraint qualification.

Recommendations

• Exact penalty results for mathematical programs with vanishing constraints
• On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

Cites work

• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Calmness and Exact Penalization
• Calmness of constraint systems with applications
• Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
• Error bounds in mathematical programming
• Exact penalty results for mathematical programs with vanishing constraints
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
• 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 optimality conditions for mathematical programs with equilibrium constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Robot motion planning with uncertainty in control and sensing
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Variational Analysis

Cited in

(4)

• Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
• On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
• Exact penalty results for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications

This page was built for publication: On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints

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