Skip to the main content

Croatian Operational Research Review, Vol. 3 No. 1, 2012.

Original scientific paper

INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS

Goran Lešaja ; Department of Mathematical Sciences, Georgia Southern University Statesboro, Georgia, USA
Antre M. Drummer ; Department of Mathematics, East Georgia College Swainsboro, Georgia, USA
Ljiljana Miletić ; Department of Mathematics and Computer Science Požega High School, Požega, Croatia

Full text: english pdf 118 Kb

page 163-175

downloads: 747

cite

Abstract

In this paper we consider an Infeasible Full Newton-step Interior-Point Method (IFNS-IPM) for monotone Linear Complementarity Problems (LCP). The method does not require a strictly feasible starting point. In addition, the method avoids calculation of the step size and instead takes full Newton-steps at each iteration. Iterates are kept close to the central path by suitable choice of parameters. The algorithm is globally convergent and the iteration bound matches the best known iteration bound for these types of methods.

Keywords

infeasible full Newton-step interior-point method; linear complementarity problem; iteration bound

Hrčak ID:

96813

URI

https://hrcak.srce.hr/96813

Publication date:

30.12.2012.

Visits: 1.319 *