论文信息 - A new condition number for linear programming

A new condition number for linear programming

Abstract.In this paper we define a new condition number ?(A) for the following problem: given a m by n matrix A, find x∈ℝn, s.t. Ax<0. We characterize this condition number in terms of distance to ill-posedness and we compare it with existing condition numbers for the same problem.

Felipe Cucker | Dennis Cheung | F. Cucker | D. Cheung

[1] Yinyu Ye,et al. Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming , 1994, Math. Oper. Res..

[2] James Renegar,et al. Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[3] Y. Ye,et al. Condition numbers for polyhedra with real number data , 1995, Oper. Res. Lett..

[4] James Renegar,et al. Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

[5] Yinyu Ye,et al. A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..

[6] Robert M. Freund,et al. Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system , 1999, Math. Program..

[7] R. Freund,et al. Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems , 2000 .