Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
文献类型：期刊论文
| 作者 | Zhao, Y. B. |
| 刊名 | APPLIED NUMERICAL MATHEMATICS
 |
| 出版日期 | 2007-09-01 |
| 卷号 | 57期号:9页码:1033-1049 |
| 关键词 | linear programming interior-point algorithms iteration complexity neighborhoods |
| ISSN号 | 0168-9274 |
| DOI | 10.1016/j.apnum.2006.09.009 |
| 英文摘要 | It is well known that a wide-neighborhood interior-point algorithm for linear programming performs much better in implementation than its small-neighborhood counterparts. In this paper, we provide a unified way to enlarge the neighborhoods of predictor-corrector interior-point algorithms for linear programming. We prove that our methods not only enlarge the neighborhoods but also retain the so-far best known iteration complexity and superlinear (or quadratic) convergence of the original interior-point algorithms. The idea of our methods is to use the global minimizers of proximity measure functions. (C) 2006 IMACS. Published by Elsevier B.V. All rights reserved. |
| 语种 | 英语 |
| WOS记录号 | WOS:000248182700005 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/4372]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhao, Y. B. |
| 作者单位 | Chinese Acad Sci, AMSS, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhao, Y. B.. Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions[J]. APPLIED NUMERICAL MATHEMATICS,2007,57(9):1033-1049. |
| APA | Zhao, Y. B..(2007).Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions.APPLIED NUMERICAL MATHEMATICS,57(9),1033-1049. |
| MLA | Zhao, Y. B.."Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions".APPLIED NUMERICAL MATHEMATICS 57.9(2007):1033-1049. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。