Average number of iterations of some polynomial interior-point - Algorithms for linear programming
文献类型:期刊论文
作者 | Huang, SM |
刊名 | SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
![]() |
出版日期 | 2000 |
卷号 | 43期号:8页码:7,829-835 |
关键词 | Linear Programming Interior Point Algorithms Probabilistic Lp Models Average Number Of Iterations |
ISSN号 | 1006-9283 |
英文摘要 | We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite termination technique, is bounded above by O( n(1.5)). The random LP problem is Todd's probabilistic model with the standard Gauss distribution. |
学科主题 | Mathematics ; Applied ; Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000089197300007 |
公开日期 | 2012-11-12 |
源URL | [http://ir.casipm.ac.cn/handle/190111/5367] ![]() |
专题 | 科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) |
推荐引用方式 GB/T 7714 | Huang, SM. Average number of iterations of some polynomial interior-point - Algorithms for linear programming[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,2000,43(8):7,829-835. |
APA | Huang, SM.(2000).Average number of iterations of some polynomial interior-point - Algorithms for linear programming.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,43(8),7,829-835. |
MLA | Huang, SM."Average number of iterations of some polynomial interior-point - Algorithms for linear programming".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY 43.8(2000):7,829-835. |
入库方式: OAI收割
来源:科技战略咨询研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。