Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T05:03:45.704Z Has data issue: false hasContentIssue false

Asymptotic analysis of the trajectoriesof the logarithmic barrier algorithm without constraint qualifications

Published online by Cambridge University Press:  17 May 2008

A. El Afia
Affiliation:
Université Mohammed V, Souisi, ENSIAS, Rabat, Maroc; elafia@ensias.ma
A. Benchakroun
Affiliation:
Université de Sherbrooke, Dép. d'informatique, Canada; Abdelhamid.Benchakroun@usherbrooke.ca
J.-P. Dussault
Affiliation:
Université de Sherbrooke, Dép. d'informatique, Canada; Jean-Pierre.Dussault@usherbrooke.ca
K. El Yassini
Affiliation:
Université Moulay Ismail, Faculté des Sciences à Meknès, Maroc; Khalid.ElYassini@usherbrooke.ca
Get access

Abstract

In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinearprogram when the set Λ* of the Karush-Kuhn-Tucker multiplier vectors is emptyowing to the fact that the constraint qualifications are not satisfied.


Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable