.png){kind=icon}
返回
A polynomial path following algorithm for convex programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.07.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, based on combined homotopy interior point method we propose an interior point algorithm for convex nonlinear programming. The algorithm ensures that the obtained iterative points are interior points of the feasible set in terms of the technique of beta-cone neighborhood. We establish the global convergence of the algorithm. Furthermore, it is shown that the algorithm has O(root nL) iteration complexity. The preliminary numerical experiments indicate that the algorithm is efficient. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
convex nonlinear programming
combined homotopy
path following algorithm
global convergence
polynomial-time algorithm
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Transformational Leadership Incorporating Employee Change Acceptance in the Banking Sector: Mediating Effect of Workplace Spirituality变革型领导力纳入员工变革接受度：银行业中的中介作用机制研究
OAAI
.png){kind=icon}
OAAI分享收藏 没有更多内容
没有更多内容