The research activity focuses on the sequential quadratic programming method SQP, exploring its local quadratic convergence properties. The study aims to provide a deeper understanding of the method's behavior, particularly in cases where the set of Lagrange multipliers is not a singleton. This research has significant implications for the development of efficient optimization algorithms and the analysis of constrained optimization problems.