Complexity of Error Bounds for Systems of Linear Inequalities

Abstract: Error bounds have been studied for over seventy years, beginning with Hoffman's 1952 result [ J. Res. Natl. Bur. Standards, 49(1952), 263-65], which provided a bound on the distance from any point to the solution set of a linear system. However, little is known about the inherent intractability of error bounds. This paper focuses on the complexity of error bounds and stbaility of error bounds for systems of linear inequalities. For the complexity of error bounds for linear inequalities, we reformulate this problem as the task of solving finitely many min-max problems-defined by certain rows of the given matrix over the sphere and then prove that this problem is not in the class P, but it is in the clathat there exist pseudo-polynomial time algorithms to solve both the error bounds problem and its complement. In particular, the complement is a number problem, but not NP-complete in the strong sense (unless P = NP). For the complexity of stability of error bounds, it is proved that this problem is not in the class P. However, such problem becomes polynomially solvable when the dimension is fixed.