摘要
将非线性互补问题转化为光滑方程组是求解非线性互补问题的一个重要途径.通过对min函数的光滑化,引入了一个新的光滑NCP函数,并在此基础上建立了求解P0函数非线性互补问题的一步光滑牛顿法;同时在较弱的条件下证明了该算法的适定性和全局收敛性.
It was an important approach to convert the nonlinear complementarity problem（NCP） into solving a smooth equation.By introducing a new smoothing NCP function,the problem was approximated by a family of parameterized smoothing equation.A one-step smoothing Newton algorithm was presented to solve the NCP with P0 function（denoted by P0-NCP） based on the new smoothing NCP function of generalized min-function.The proposed algorithm is proved to be well-defined and convergent globally under weaker condition.
出处
《福建农林大学学报（自然科学版）》
CSCD
北大核心
2010年第2期216-221,共6页
Journal of Fujian Agriculture and Forestry University:Natural Science Edition
基金
国家自然科学基金(10661005)
福建省自然科学基金资助项目(2009J01002)
关键词
min函数
非线性互补问题
光滑牛顿法
全局收敛性
min-function
nonlinear complementarity problem（NCP）
smoothing Newton method
global convergence
