龚小玉;张明望;

• 1:茂名学院理学院
• 2:三峡大学理学院

摘要(Abstract)：

对P*(κ)-阵线性互补问题提出了一种高阶内点算法.算法的每步迭代是基于线性规划原始-对偶仿射尺度算法的思想来确定迭代方向,再通过适当选取步长,得到算法的多项式复杂性.

关键词(KeyWords)： 互补问题;高阶仿射尺度;多项式复杂性;内点算法;P*(κ)-矩阵

Abstract:

Keywords:

基金项目(Foundation): 湖北省教育厅自然科学重点科研基金资助项目(D200613009)

作者(Authors): 龚小玉;张明望;

参考文献(References)：

• [1]Karmarkar N.A new polynomial-time algorithm for linear programming[J].Combinatorica,1984,20:373-395.
• [2]Ye Y.Interior Point Algorithm-Theory and Analysis[M].New York:John Wiley and sons,1997.
• [3]Andersen E D,Ye Y.On homogeneous algorithm for the monotone complementary problem[J].Mathematical Programming,1999,84(2):375-399.
• [4]Kojima M,Megiddo N,Ye Y.An interior-point potential reduction algorithm for the linear complementary problem[J].Mathematical Programming,1992,54(2):267-279.
• [5]孙清滢,常兆光,王清华.一个求解线性不等式约束的非线性规划的广义梯度投影内点算法[J].纯粹数学与应用数学,1999,15(1):92-98.
• [6]He Shanglu,Xu Chengxian.A path-following method for a class of nonmonotone linear complementary problems and its computational complexity[J].Mathematical Numerical Science,2001,23(3):299-306.
• [7]Zhang Mingwang,Huang Congchao.A high-order affine scaling algorithm for a class of nonmonotonic linear complementary problems[J].Mathematica Numerica Sinica,2004,26(1):37-46.
• [8]Monteiro R D C,Alder I,Resencle M C C.A polynomical-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension[J].Mathematics of Operoctions Research,1990,15(1):191-214.
• [9]Thao G,Sun J.On the rate of local convergence of high-order infeasible path following algorithm[J].Computational Optimization and Applications,1993,14(3):293-307.
• [10]Kojima,Megiddo M,Noma N.A unified approach to interior algorithms for linear complementary problems[M].New York Springer:Lecture Notes in Computer Science,1991.