# A cone-continuity constraint qualification and algorithmic consequences

Every local minimizer of a smooth constrained optimization problem satisfies the sequential Approximate Karush-Kuhn-Tucker (AKKT) condition. This optimality condition is used to define the stopping criteria of many practical nonlinear programming algorithms. It is natural to ask for conditions on the constraints under which AKKT implies KKT. These conditions will be called Strict Constraint Qualifications (SCQ). In this paper we define a Cone-Continuity Property (CCP) that will be showed to be the weakest possible SCQ. Its relation with other constraint qualifications will also be clarified. In particular, it will be proved that CCP is strictly weaker than the Constant Positive Generator (CPG) constraint qualification.