期刊文献+

投影AOR迭代求解双边障碍问题

Projected AOR Iterative Solution for Two-sided Obstacle Problems
下载PDF
导出
摘要 研究了求解双边障碍问题的AOR迭代算法.证明由此算法产生的迭代序列至少存在一个聚点,该聚点是双边障碍问题的解,并且当矩阵为非退化对称矩阵时,该序列收敛到双边障碍问题的解. In this paper, AOR algorithm for solving two - sided obstacle problems is considered. It is shown that the sequence generated by the AOR algorithm has an accumulation point which solves the two - sided obstacle problem. Moreover, when the matrix M involved in the two- sided obstacle problem is symmetric and non - degenerate, the sequence converges to a solution of the problem.
出处 《佳木斯大学学报(自然科学版)》 CAS 2007年第1期117-119,共3页 Journal of Jiamusi University:Natural Science Edition
关键词 投影AOR迭代 对称矩阵 双边障碍问题 projection of the AOR iterate symmetric matrix two- sided obstacle prob - lem
  • 相关文献

参考文献8

  • 1O.L.Mangasarian.Solution of Symmetric Linear Complementarity Problems by Iterative Methods[J].J.Opt.Theory.Appl.,22(1977),465-485.
  • 2P.T.Harker,J.S.Pang.Finite-dimensional Variational Inequality and Nonlinear Complementarity Problems:A Survey of Theory Algo-rithms and Applications[J].Math.Porg.,48(1990),161-220.
  • 3Y.Y.Lin,J.S.Pang.Iterative Methods for Large Convex Quadratic Programs:a Survey[J].SIAM J.Control Opt.,25(1987),384-411.
  • 4J.M.Ortega.W.C.Rheinboldt.Iterative Solution of Nonlinear Equations in Several Variables[M].Academic Press,1970.
  • 5P.Tseng.Decomposition Algorithm Forconvex Differentiable Minimization[J].J.O-pt.Theory Appl.,70(1991),109-136.
  • 6Z.Q.Luo,P.Tseng.On the Convergence of a Matrix Splitting Algorithm for the Sym-metric Monotone Linear Complementarityproblem[J].SIAM J.Control Opt.,29(1991),1037-1060.
  • 7A.M.Ostrowski.Solution of Equations and Systems of Equations[M].Second Edition,Academic Press,NewYork,New York,1996.
  • 8K.G.Murty.On the Number of Solutions to the Complementarity Problem and Spanning Propertites of Complementary Co-nes[J].Linear Algebra Appl.,Vol.5(1972),65-108.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部