Expected number of iterations of interior-point algorithms for linear programming
文献类型：期刊论文
| 作者 | Huang, SM |
| 刊名 | JOURNAL OF COMPUTATIONAL MATHEMATICS
 |
| 出版日期 | 2005 |
| 卷号 | 23期号:1页码:8,93-100 |
| 关键词 | Linear Programming Lnterior Point Algorithms Probabilistic Lp Models Expected Number Of Iterations |
| ISSN号 | 0254-9409 |
| 英文摘要 | We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the expected and anticipated number of iterations of these algorithms is bounded above by O(n(1.5)). The random LP problem is Todd's probabilistic model with the Cauchy distribution. |
| 学科主题 | Mathematics ; Applied ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000227903500009 |
| 公开日期 | 2012-11-12 |
| 源URL | [http://ir.casipm.ac.cn/handle/190111/5041]  |
| 专题 | 科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) |
| 推荐引用方式 GB/T 7714 | Huang, SM. Expected number of iterations of interior-point algorithms for linear programming[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2005,23(1):8,93-100. |
| APA | Huang, SM.(2005).Expected number of iterations of interior-point algorithms for linear programming.JOURNAL OF COMPUTATIONAL MATHEMATICS,23(1),8,93-100. |
| MLA | Huang, SM."Expected number of iterations of interior-point algorithms for linear programming".JOURNAL OF COMPUTATIONAL MATHEMATICS 23.1(2005):8,93-100. |
入库方式： OAI收割
来源：科技战略咨询研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。