# Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems

- First Online:

- Received:
- Revised:

DOI: 10.1007/s10107-004-0519-6

- Cite this article as:
- Cánovas, M., López, M., Parra, J. et al. Math. Program. (2005) 103: 95. doi:10.1007/s10107-004-0519-6

- 31 Citations
- 151 Downloads

## Abstract.

In this paper we consider the parameter space of all the linear inequality systems, in the *n*-dimensional Euclidean space, with a fixed and arbitrary (possibly infinite) index set. This parameter space is endowed with the topology of the uniform convergence of the coefficient vectors by means of an extended distance. Some authors, in a different context in which the index set is finite and, accordingly, the coefficients are bounded, consider the boundary of the set of consistent systems as the set of ill-posed systems. The distance from the nominal system to this boundary (‘distance to ill-posedness’), which constitutes itself a measure of the stability of the system, plays a decisive role in the complexity analysis of certain algorithms for finding a solution of the system. In our context, the presence of infinitely many constraints would lead us to consider separately two subsets of inconsistent systems, the so-called strongly inconsistent systems and the weakly inconsistent systems. Moreover, the possible unboundedness of the coefficient vectors of a system gives rise to a special subset formed by those systems whose distance to ill-posedness is infinite. Attending to these two facts, and according to the idea that a system is ill-posed when small changes in the system’s data yield different types of systems, now the boundary of the set of strongly inconsistent systems arises as the ‘generalized ill-posedness’ set. The paper characterizes this generalized ill-posedness of a system in terms of the so-called associated hypographical set, leading to an explicit formula for the ‘distance to generalized ill-posedness’. On the other hand, the consistency value of a system, also introduced in the paper, provides an alternative way to determine its distance to ill-posedness (in the original sense), and additionally allows us to distinguish the consistent well-posed systems from the inconsistent well-posed ones. The finite case is shown to be a meeting point of our linear semi-infinite approach to the distance to ill-posedness with certain results derived for conic linear systems. Applications to the analysis of the Lipschitz properties of the feasible set mapping, as well as to the complexity analysis of the ellipsoid algorithm, are also provided.