摘 要:
对一致P-函数非线性互补问题,提出了一种新的宽邻域(N^-∞(β))路径跟踪算法,并讨论了该算法的收敛性及计算复杂性。分析结果表明,所给方法是一多项式时间算法。[著者文摘]
关 键 词:
文章出处:
《应用数学》-2006年19卷4期 -759-764页
Mathematica Applicata
分 类 号:
文献标识码:
A
文章编号:
1001-9847(2006)04-0759-06
A Wide-Neighborhood Path-Following Algorithms for a Class of P- Function Nonlinear Complementary Problems and its Computational Complexity
WANG Jun-ling (College of Science, China Three Gorges University, Yichang 443002, China)
Abstract:
In this paper,a new wide-neighborhood path-following algorithms for uniform P-function nonlinear complementary problems is presented,and its convergence and computational complexity is discussed. The results indicate that the algorithm is a polynomial-time one.[著者文摘]
Key words:
P- function nonlinear complementary problem; Wide-neighborhood path-following method ; Computational complexity ; Uniform P- function
收稿日期: 2006-02-27
基金资助:
湖北省教育厅重点科研项目(D200613009);教育部人文社科规化基金资助项目(01JA790068)

更多评论>>文章评论
学术















cqvip.com