Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems
Yugoslav Journal of Operations Research · 2002
DOI: 10.2298/yjor0201017l ↗Kurz gefasst
Fachartikel in der Zeitschrift Yugoslav Journal of Operations Research, 2002. Verfasst von Goran Lesaja. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).
Abstract (Originalsprache)
A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem. The algorithm achieves linear global convergence and quadratic local convergence under the following assumptions: the function satisfies a modified scaled Lipschitz condition, the problem has a strictly complementary solution, and certain submatrix of the Jacobian is nonsingular on some compact set.
Zitieren
APA
Lesaja, G. (2002). Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems. Yugoslav Journal of Operations Research. https://doi.org/10.2298/yjor0201017l
Vancouver
Lesaja G. Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems. Yugoslav Journal of Operations Research. 2002. doi:10.2298/yjor0201017l
BibTeX
@article{Lesaja2002,
author = {Lesaja, Goran},
title = {Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems},
journal = {Yugoslav Journal of Operations Research},
year = {2002},
doi = {10.2298/yjor0201017l}
}
EUVIMED