A New Searching Direction for Linear Complementarity Problems

Abstract:

Article Preview

In this paper, we investigate the properties of a simple function. As an application, we present a full-step interior-point algorithm for linear complementarity problem. The algorithm uses the simple function to determine the searching direction and define the neighborhood of central path. The full-step used in the algorithm has local quadratic convergence property according to the proximity function which is also constructed by this simple function. We derive the iteration complexity for the algorithm and obtain the best-known iteration bounds for linear complementarity problem.

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1089-1092

DOI:

10.4028/www.scientific.net/AMR.219-220.1089

Citation:

L. P. Zhang and Y. H. Xu, "A New Searching Direction for Linear Complementarity Problems", Advanced Materials Research, Vols. 219-220, pp. 1089-1092, 2011

Online since:

March 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.