Toward probabilistic analysis of interior-point algorithms for linear programming
Mathematics of Operations Research
Some perturbation theory for linear programming
Mathematical Programming: Series A and B
Linear programming, complexity theory and elementary functional analysis
Mathematical Programming: Series A and B
Unifying Condition Numbers for Linear Programming
Mathematics of Operations Research
Hi-index | 0.00 |
In a paper Cheung, Cucker and Pena (in press) [5] that can be seen as the first part of this one, we extended the well-known condition numbers for polyhedral conic systems C(A) Renegar (1994, 1995) [7-9] and C(A) Cheung and Cucker (2001) [3] to versions C@?(A) and C@?(A) that are finite for all input matrices A@?R^n^x^m. In this paper we compare C@?(A) and C@?(A) with other condition measures for the same problem that are also always finite.