How Partial Knowledge Helps to Solve Linear Programs
暂无分享,去创建一个
We present results on how partial knowledge helps to solve linear programs. In particular, if a linear system,Ax=bandx?0, has an interior feasible point, then we show that finding a feasible point to this system can be done inO(n2.5c(A)) iterations by the layered interior-point method, and each iteration solves a least-squares problem, wherenis the dimension of vectorxandc(A) is the condition number of matrixAdefined by Vavasis and Ye. This complexity bound is reduced by a factornfrom that when this property does not exists. We also present a result for solving the problem using a little strong knowledge.
[1] Clovis C. Gonzaga,et al. A note on properties of condition numbers , 1997 .
[2] Yinyu Ye,et al. A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..
[3] James Renegar,et al. Towards a computational complexity theory that uses approximate data and knowledge , 1993 .
[4] Yinyu Ye,et al. On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..