Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00245-005-0827-0
Title: A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties
Authors: Huang, Z.-H.
Sun, J. 
Keywords: Global convergence
Global linear convergence
Linear complementarity problem
Local superlinear convergence
Non-interior continuation algorithm
Issue Date: 2005
Source: Huang, Z.-H., Sun, J. (2005). A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties. Applied Mathematics and Optimization 52 (2) : 237-262. ScholarBank@NUS Repository. https://doi.org/10.1007/s00245-005-0827-0
Abstract: We propose a non-interior continuation algorithm for the solution of the linear complementarity problem (LCP) with a P0 matrix. The proposed algorithm differentiates itself from the current continuation algorithms by combining good global convergence properties with good local convergence properties under unified conditions. Specifically, it is shown that the proposed algorithm is globally convergent under an assumption which may be satisfied even if the solution set of the LCP is unbounded. Moreover, the algorithm is globally linearly and locally superlinearly convergent under a nonsingularity assumption. If the matrix in the LCP is a P* matrix, then the above results can be strengthened to include global linear and local quadratic convergence under a strict complementary condition without the nonsingularity assumption. © 2005 Springer Science+Business Media, Inc.
Source Title: Applied Mathematics and Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/43953
ISSN: 00954616
DOI: 10.1007/s00245-005-0827-0
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

20
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

9
checked on Nov 22, 2017

Page view(s)

70
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.