2000 character limit reached
On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints (1806.00632v2)
Published 2 Jun 2018 in math.OC
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.