Regularization Semismooth Newton Method for P-NCPs with Non-monotone Line Search

被引:0
|
作者
王萍 [1 ]
臧玉卫 [2 ]
张颖 [1 ]
机构
[1] 不详
[2] School of Sciences,Tianjin University
[3] 不详
[4] Tianjin University Beiyang Science and Technology Development Co Ltd
[5] 不详
关键词
D O I
暂无
中图分类号
O224 [最优化的数学理论];
学科分类号
摘要
Based on the generalized Fischer-Burmeister function, Chen et al in 2008 put forward a regularization semismooth Newton method for solving the nonlinear complementarity problem with a P0-function. In this paper, we investigate the above algorithm with the monotone line search replaced by a non-monotone line search. It is shown that the non-monotone algorithm is well-defined, and is globally and locally superlinearly convergent under standard assumptions.
引用
收藏
页码:138 / 141
页数:4
相关论文
共 50 条