NCP(F)的两种光滑信赖域解法的超线性收敛性  

The Superlinear Convergence Property of Two Smoothing Trust Region Methods for the NCP(F)

作　　者：董建新[1] 王希云[2] 

机构地区：[1]长治学院数学系,山西长治046011 [2]太原科技大学应用科学学院,山西太原030024

出　　处：《长治学院学报》2012年第2期30-33,共4页Journal of Changzhi University

基　　金：长治学院校级基金资助项目(2011112)

摘　　要：自适应光滑信赖域算法和非单调自适应光滑信赖域算法是求解非线性互补问题的两种解法,证明了F是P0函数时,两种算法都具有超线性收敛性,并且通过数值实验证明了两种算法的有效性。The smoothing and self-trust region algorithm and the smoothing and nonmontone self-trust region algorithm are two methods for the NCP（F）.With the assumption that F is a P0 function,we prove the superlinear convergence of the two algorithms,and the efficiency of the algorithms is shown by numerical results.

关 键 词：非线性互补问题 光滑信赖域算法 超线性收敛性 

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