Average number of iterations of some polynomial interior-point - Algorithms for linear programming

CASISD OpenIR > 中国科学院科技政策与管理科学研究所(1985年6月-2015年12月)

	Average number of iterations of some polynomial interior-point - Algorithms for linear programming
	Huang, SM
发表期刊	SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
关键词	Linear Programming Interior Point Algorithms Probabilistic Lp Models Average Number Of Iterations
摘要	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.
	2000
卷号	43 期号:8 页码:7,829-835
ISSN	1006-9283
学科领域	Mathematics ; Applied ; Mathematics
收录类别	SCI
语种	英语
WOS记录号	WOS:000089197300007
引用统计	被引频次：1[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.casisd.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.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
A v e r a g e n.pdf（333KB）			开放获取	--	浏览