Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinear program when the set Λ* of the Karush-Kuhn-Tucker multiplier vectors is empty owing to the fact that the constraint qualifications are not satisfied.