.png){kind=icon}
返回
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.02.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Primal-dual interior-point methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible starting point to generate the iterates that converge to an optimal solution. The self-dual embedding model provides an elegant solution to this problem with the cost of slightly increasing the size of the problem. On the other hand, infeasible interior point methods (IIPMs) can be initiated by any positive vector, and thus are popular in IPMs based software packages. In this paper we propose an adaptive large-update IIPM based on a specific self-regular proximity function, with barrier degree 1 + log n, that operates in a negative infinity neighborhood of the central path. An O(n(3/2) log n log n/epsilon) worst-case iteration bound of the new algorithm is established. This iteration bound improves the so far best O(n(2) log n/epsilon) iterations bound of IIPMs in a large neighborhood of the central path. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
linear optimization
infeasible interior point methods
self-regular functions
adaptive large update
polynomial complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Sex differences in response to obesity and caloric restriction on cognition and hippocampal measures of autophagic-lysosomal transcripts and signaling pathways性别差异在肥胖及热量限制对认知功能和海马体自噬-溶酶体转录本及信号通路的影响
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏分享收藏分享收藏
查看更多内容