Session: Constraint Qualification and Error Bound
Chair: Mariana da Rosa
Cluster: nan
Talk 1: TBD
Speaker: Meisam Razaviyayn
Abstract: TBD
Talk 2: Reparametrization of feasible sets: new constraint qualifications in nonlinear programming and connections to MFCQ
Speaker: Mariana da Rosa
Abstract: It is well known that constant rank-type constraint qualifications (CQs) imply the Mangasarian-Fromovitz CQ (MFCQ) after a suitable local reparametrization of the feasible set. This process involves eliminating redundancies without changing the feasible set locally. Traditionally, such reparametrizations have been used to highlight connections between well-established CQs from the literature. In this talk, we take a different perspective by introducing a type of reparametrization that itself constitutes a CQ. We conduct a thorough study of such reparametrizations, not only in the context of MFCQ but also in relation to arbitrary CQs, and discuss the relationship between these CQs obtained via reparametrizations and the local error bound property. Additionally, we propose a relaxed version of CRSC, called constrained CRSC, which retains the key geometric properties of CRSC, is linked to reparametrizations leading to MFCQ, and also guarantees the local error bound property. Preprint: https://optimization-online.org/?p=28999
