摘要
将非线形互补问题转化为约束的优化问题,在已经的利用内点障碍函数方法求解约束优化问题的基础上,提出了利用障碍函数方法求解非线形互补问题的采用序列无约束最小化方法(SUMT)的算法,并利用障碍函数的单调性证明了算法的全局收敛性.最后得出的数值试验表明了算法具有良好的适宜性和强收敛性.
This paper converts the nonlinear complementarity problems into the question of constrained optimization, and then puts forward we introduce Sequential Unconstrained Minimization Technique (SUMT) algorithm to solve the nonlinear complementarity problems using barrier functions on the basis of the existing solutions to constrained optimization with existing barrier function. Furthermore, with the monotonicity of barrier functions, this paper proves the convergence of the algorithm. Finally, a numerical example is given to illustrate the good regularity and strong convergence of this algorithm.
出处
《重庆工学院学报》
2007年第3期32-34,共3页
Journal of Chongqing Institute of Technology
基金
国家自然科学基金资助项目(40301037)
甘肃省自然科学基金资助项目(3ZS042-B25-049)
关键词
非线形互补问题
障碍函数
序列无约束最小化方法
收敛
nonlinear complementarity problem
barrier function
sequential unconstrained minimizationtechnique
convergence