Long-step homogeneous interior-point algorithm for the P*-nonlinear complementarity problems

Long-step homogeneous interior-point algorithm for the P*-nonlinear complementarity problems

0.00 Avg rating0 Votes
Article ID: iaor20023488
Country: Serbia
Volume: 12
Issue: 1
Start Page Number: 17
End Page Number: 48
Publication Date: Jan 2002
Journal: Yugoslav Journal of Operations Research
Authors:
Keywords: programming: linear
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.