Reparametrization of feasible sets: new constraint qualifications for nonlinear programming and their properties
It is known that constant rank-type constraint qualifications (CQs) imply the Mangasarian-Fromovitz CQ (MFCQ) after a suitable local reparametrization of the feasible set, which involves eliminating redundancies (remove and/or transform inequality constraints into equalities) without changing the feasible set locally. This technique has been mainly used to study the similarities between well-known CQs from the … Read more