中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A globally and locally superlinearly convergent non interior-point algorithm for P-0 LCPs

文献类型:期刊论文

作者Zhao, YB; Li, D
刊名SIAM JOURNAL ON OPTIMIZATION
出版日期2003
卷号13期号:4页码:1195-1221
关键词linear complementarity problem non interior-point algorithm Tikhonov regularization P-0 matrix regularized central path
ISSN号1052-6234
英文摘要Based on the concept of the regularized central path, new non interior-point path-following algorithm is proposed for solving the P-0 linear complementarity problem (P-0 LCP). The condition ensuring the global convergence of the algorithm for P-0 LCPs is weaker than most conditions previously used in the literature. This condition can be satisfied even when the strict feasibility condition, which has often been assumed in most existing non interior-point algorithms, fails to hold. When the algorithm is applied to P-* and monotone LCPs, the global convergence of this method requires no assumption other than the solvability of the problem. The local superlinear convergence of the algorithm can be achieved under nondegeneracy assumption. The effectiveness of the algorithm is demonstrated by our numerical experiments.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000183166900014
出版者SIAM PUBLICATIONS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/18241]  
专题中国科学院数学与系统科学研究院
通讯作者Zhao, YB
作者单位1.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
2.Chinese Acad Sci, Inst Appl Math, AMSS, Beijing, Peoples R China
推荐引用方式
GB/T 7714
Zhao, YB,Li, D. A globally and locally superlinearly convergent non interior-point algorithm for P-0 LCPs[J]. SIAM JOURNAL ON OPTIMIZATION,2003,13(4):1195-1221.
APA Zhao, YB,&Li, D.(2003).A globally and locally superlinearly convergent non interior-point algorithm for P-0 LCPs.SIAM JOURNAL ON OPTIMIZATION,13(4),1195-1221.
MLA Zhao, YB,et al."A globally and locally superlinearly convergent non interior-point algorithm for P-0 LCPs".SIAM JOURNAL ON OPTIMIZATION 13.4(2003):1195-1221.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。