| 基于代数等价路径的一致P-函数非线性互补问题的可行内点算法 |
| |
| 引用本文： | 王浚岭.基于代数等价路径的一致P-函数非线性互补问题的可行内点算法[J].应用数学,2007,20(2):351-356. |
| |
| 作者姓名： | 王浚岭 |
| |
| 作者单位： | 三峡大学理学院数学系,湖北,宜昌,443002 |
| |
| 摘 要： | 对一致P-函数非线性互补问题，提出了一种新的基于代数等价路径的可行内点算法，并讨论了计算复杂性．该算法可以在任一内部可行点启动，并且全局收敛；当初始点靠近中心路径时，此算法便成为中心路径跟踪算法，特别对于单调线性互补问题，总迭代次数为O（√nL），其中L是问题的输入长度。
|
| 关 键 词： | 非线性互补问题 内点算法 代数等价路径 一致P-函数 全局收敛性 计算复杂性 |
| 文章编号： | 1001-9847(2007)02-0351-06 |
| 修稿时间： | 2006-09-04 |
Interior-point Algorithms for Uniform P-function Nonlinear Complementary Problem Based on Algebraically Equivalent Path |
| |
| WANG Jun-ling.Interior-point Algorithms for Uniform P-function Nonlinear Complementary Problem Based on Algebraically Equivalent Path[J].Mathematica Applicata,2007,20(2):351-356. |
| |
| Authors: | WANG Jun-ling |
| |
| Institution: | College of Science, China Three Gorges University, Yichang 443002 ,China |
| |
| Abstract: | In this paper, a new feasible-interior-point algorithms based on algebraically equivalent path for uniform P-function nonlinear complementary problems is presented, and its computational complexity is discussed. It can be started at any interior feasible point, and the paper prove that algorithm enjoys the global convergence. If the initial point is close to the central path, it becomes a central path-following algorithm. Especially, monotonic linear complementary problems requires a total of O(n~(1/2)L) number of iterations, where L is the input length. |
| |
| Keywords: | Nonlinear complementary problem Interior-point algorithms Algebraically equivalent path Uniform P-function Global convergence Computational complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
