期刊文献+

单调非线性互补问题的不可行内点算法

AN INFEASIBLE-INTERIOR-POINT-ALGORITHM FOR MONOTONE NONLINEAR COMPLEMENTARITY PROBLEM
在线阅读 下载PDF
导出
摘要 为了克服内点算法初始点不易给出的缺陷,本文给出了一个求解单调非线性互补问 题的不可行内点算法,并证明了算法的收敛性. In this paper an infeasible-interior-point algorithm is proposed for monotone nonlinear complementarity problems, and its convergence is given.
出处 《数学杂志》 CSCD 北大核心 2003年第1期33-36,共4页 Journal of Mathematics
基金 国家教育部博士点基金(20020486035)
关键词 单调非线性互补问题 不可行内点算法 收敛性 monotone nonlinear complementarity problem t infeasible-interior- point algorithm
  • 相关文献

参考文献5

  • 1Karmarkar N. A new polynomial-time algorithm for linear programming[J]. Combinatovica. 1984,4:373~395
  • 2Lustig L J. , Marsten R.E. and Shanno D.F. Computational experience with a primal-dual interiorpoint method for linear programming[J]. Linear Algebra and Its Applications. 1991,152:191~222
  • 3Zhang Y. On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem[J]. SIAM J. Optimization. 1994, 4(1) :208~227
  • 4Durazzi C. On the Newton interior-point method for nonlinear programming problems. Journal of Optimization Theory and Applications. 2000,104(1):73~90
  • 5Byrd R. H., Nocedal J. A tool for the analysis of Quasi-Newton methods with application to unconstrained minimization[J]. SIAM J. Numerical Analysis. 1989, 26:727~739

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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