A Non-Interior Continuation Algorithm for the P0 or P* LCP with Strong Global and Local Convergence Properties

作者: Zheng-Hai Huang$ , Jie Sun

DOI: 10.1007/S00245-005-0827-0

关键词:

摘要: We propose a non-interior continuation algorithm for the solution of linear complementarity problem (LCP) with P0 matrix. The proposed differentiates itself from current algorithms by combining good global convergence properties local under unified conditions. Specifically, it is shown that globally convergent an assumption which may be satisfied even if set LCP unbounded. Moreover, linearly and locally superlinearly nonsingularity assumption. If matrix in P* matrix, then above results can strengthened to include quadratic strict complementary condition without

参考文章(34)
Bintong Chen, Xiaojun Chen, A Global and Local Superlinear Continuation-Smoothing Method for P 0 and R 0 NCP or Monotone NCP Siam Journal on Optimization. ,vol. 9, pp. 624- 645 ,(1999) , 10.1137/S1052623497321109
Xiaojun Chen, Yinyu Ye, On Smoothing Methods for the P 0 Matrix Linear Complementarity Problem Siam Journal on Optimization. ,vol. 11, pp. 341- 363 ,(2000) , 10.1137/S1052623498335080
Liqun Qi, Jie Sun, A nonsmooth version of Newton's method Mathematical Programming. ,vol. 58, pp. 353- 367 ,(1993) , 10.1007/BF01581275
Jong-Shi Pang, Richard W. Cottle, Richard E. Stone, The Linear Complementarity Problem ,(1992)
Chunhui Chen, O. L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems Computational Optimization and Applications. ,vol. 5, pp. 97- 138 ,(1996) , 10.1007/BF00249052
James V. Burke, Song Xu, The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems Mathematics of Operations Research. ,vol. 23, pp. 719- 734 ,(1998) , 10.1287/MOOR.23.3.719