Article contents
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications
Published online by Cambridge University Press: 17 May 2008
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2008
References
- 1
- Cited by