Expected number of iterations of interior-point algorithms for linear programming

	Expected number of iterations of interior-point algorithms for linear programming
	Huang, SM
发表期刊	JOURNAL OF COMPUTATIONAL MATHEMATICS
关键词	Linear Programming Lnterior Point Algorithms Probabilistic Lp Models Expected Number Of Iterations
摘要	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.
	2005
卷号	23 期号:1 页码:8,93-100
ISSN	0254-9409
学科领域	Mathematics ; Applied ; Mathematics
收录类别	SCI
语种	英语
WOS记录号	WOS:000227903500009
引用统计
文献类型	期刊论文
条目标识符	http://ir.casisd.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.