返回
A polynomial arc-search interior-point algorithm for convex quadratic programming
DOI:10.1016/j.ejor.2011.06.020.png)
摘要
En 中文
Arc-search is developed for linear programming in [24,25]. The algorithms search for optimizers along an ellipse that is an approximation of the central path. In this paper, the arc-search method is applied to primal-dual path-following interior-point method for convex quadratic programming. A simple algorithm with iteration complexity O(root nlog(1/epsilon)) is devised. Several improvements on the simple algorithm, which improve computational efficiency, increase step length, and further reduce duality gap in every iteration, are then proposed and implemented. It is intuitively clear that the iteration with these improvements will reduce the duality gap more than the iteration of the simple algorithm without the improvements, though it is hard to show how much these improvements reduce the complexity bound. The proposed algorithm is implemented in MATLAB and tested on quadratic programming problems originating from [13]. The result is compared to the one obtained by LOQO in [22] The proposed algorithm uses fewer iterations in all these problems and the number of total iterations is 27% fewer than the one obtained by LOQO. This preliminary result shows that the proposed algorithm is promising. Published by Elsevier B.V.
Keyword:
Arc-search
Convex quadratic programming
Interior-point method
Polynomial algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Genetic transfer of a functional human interferon α receptor into mouse cells: Cloning and expression of its c-DNA
Cell
IF0
A Comparison of Ideal-Point and Dominance Response Processes with a Trust in Science Thurstone Scale
Bimodal counterpropagating-responsive sensing material for the detection of histamine
RSC Advances
IF0
Allogeneic transplantation strategies including haploidentical transplantation in sickle cell disease
Hematology
IF0

