A feasible interior-point algorithm for nonconvex nonlinear programming
作者: Zhibin Zhu
作者单位: 1Department of Computational Science and Mathematics, Guilin Institute of Electronic Technology, Guilin 541004, PR China
刊名: Applied Mathematics and Computation, 2003, Vol.163 (2), pp.745-753
来源数据库: Elsevier Journal
DOI: 10.1016/j.amc.2003.10.059
关键词: Nonlinear programmingSystem of linear equationsConvex combinationInterior-point methodGlobal convergence
原始语种摘要: Abstract(#br)In this paper, a new method is presented to deal with nonconvex nonlinear inequality constrained problem by using the idea of ε -effective set. It is only required to solve two systems of linear equations per single iteration. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions.
全文获取路径: Elsevier  (合作)
影响因子:1.349 (2012)

  • convergence 汇合
  • programming 程序设计
  • nonlinear 非线性的
  • point 
  • algorithm 算法
  • constrained 约束
  • iteration 迭代
  • theoretical 理论的
  • suitable 合适的
  • conditions 条件式