Iteration complexity of an interior-point algorithm for nonlinear P*-complementarity problems
文献类型:期刊论文
作者 | Zhao, YB; Han, JY; Xu, ZZ |
刊名 | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
![]() |
出版日期 | 1999 |
卷号 | 70期号:4页码:699-715 |
关键词 | interior-point algorithm nonlinear P*-complementarity problem iterative complexity scaled Lipschitz condition |
ISSN号 | 0020-7160 |
英文摘要 | This paper provides an analysis of the iterative complexity of a predictor-corrector type interior-point algorithm for a class of non-monotone nonlinear complementarity problems, i.e., the nonlinear P*-complementarity problems, which is quite general because it includes as a special case the monotone complementarity problem. At each corrector step, one has to compute an approximate solution of a nonlinear system such that a certain accuracy requirement is satisfied. The proof of the iterative complexity of the proposed algorithm requires that the mapping associated the problem satisfies a scaled Lipschitz condition. |
WOS研究方向 | Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000079804700007 |
出版者 | GORDON BREACH SCI PUBL LTD |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/14618] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Zhao, YB |
作者单位 | 1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 2.Agr Bank China, Ctr Comp, Chongqing Branch, Chongqing 400013, Peoples R China |
推荐引用方式 GB/T 7714 | Zhao, YB,Han, JY,Xu, ZZ. Iteration complexity of an interior-point algorithm for nonlinear P*-complementarity problems[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS,1999,70(4):699-715. |
APA | Zhao, YB,Han, JY,&Xu, ZZ.(1999).Iteration complexity of an interior-point algorithm for nonlinear P*-complementarity problems.INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS,70(4),699-715. |
MLA | Zhao, YB,et al."Iteration complexity of an interior-point algorithm for nonlinear P*-complementarity problems".INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 70.4(1999):699-715. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。