学术
摘 要:
基于代数变换和不可行内点方法的思想，首次对P．（k）阵线性互补问题提出了一种宽邻域不可行内点算法，并在较弱的条件下，证明了算法的全局Q一线性收敛性和多项式复杂性。该算法可看作关于线性规划不可行内点算法的推广，也是关于单调线性互补问题不可行内点算法的推广。[著者文摘]
文章出处:
《系统工程与电子技术》-2007年29卷7期 -1188-1191页
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
1001-506X（2007）07-1188-04
New algorithm for P＊（κ）-matrix linear complementarity problem based on algebraic transformation
ZHANG Ming-wang （Coll. of Science, Three Gorges Univ. , Yichang 443002, China）
Abstract:
Based on ideal of algebraic transformation and infeasible interior point method, a wide -neighborhood infeasible interior point algorithm for P. （κ）-matrix linear complementarity problem is developed, and its global convergence analysis and polynomial-time bound are given. It can be viewed as an extension of Zhang＇s algorithm for linear programming as well as Pan＇s algorithm for monotone linear complementarity problem.[著者文摘]
Key words:
linear complementarity; infeasible interior point method; global convergence; polynomial-timecomplexity; algebraic transformation
基金资助:
湖北省教育厅重点科研项目资金资助课题（D200613009）
更多>>免费文章
cqvip.com