On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints
Triloki Nath, Abeka Khare
Abstract
Open-access reader
Triloki Nath, Abeka Khare
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Constraint (computer-aided design), Penalty method, Function (biology), Mathematical optimization, Mathematics, Computer science, Mathematical economics, Geometry