A nonmonotone inexact Broyden-like algorithm for nonlinear complementarity problems  

作　　者：Xiaomei DING Ping WANG Changfeng MA 

机构地区：[1]Department of Mathematics and Computational Science,Wuyi University,Wuyishan 354300,China [2]College of Mathematics and Computer Science,Fujian Normal University,Fuzhou 350001,China

出　　处：《Frontiers of Mathematics in China》2025年第1期25-37,共13页中国高等学校学术文摘·数学(英文)

摘　　要：In this paper,by constructing a new smoothing complementary function,we reformulate the nonlinear complementarity problem as a nonlinear smooth system of equations.Combining non-monotonic line search techniques with an inexact Broyden-like algorithm,we establish a nonmonotone inexact Broyden-like algorithm.The global and local quadratic convergence of this method is proved under suitable conditions.Numerical experiments show that the algorithm is effective for solving nonlinear complementarity problems.

关 键 词：Complementarity problem global convergence local quadratic convergence Broyden-like algorithm 

分 类 号：O224[理学—运筹学与控制论]