Distance to Ill-Posedness in Linear Optimization via the Fenchel-Legendre Conjugate
- 75 Downloads
We consider the parameter space of all the linear inequality systems, in the n-dimensional Euclidean space and with a fixed index set, endowed with the topology of the uniform convergence of the coefficient vectors. A system is ill-posed with respect to the consistency when arbitrarily small perturbations yield both consistent and inconsistent systems. In this paper, we establish a formula for measuring the distance from the nominal system to the set of ill-posed systems. To this aim, we use the Fenchel-Legendre conjugation theory and prove a refinement of the formula in Ref. 1 for the distance from any point to the boundary of a convex set.
KeywordsFenchel-Legendre conjugate stability well-posedness linear inequality systems distance to ill-posedness
Unable to display preview. Download preview PDF.
- 1.COULIBALY, A., and CROUZEIX, J. P., On the Conditioning of a Convex Set and Its Representations, Unpublished Manuscript, 2002.Google Scholar
- 6.HIRIART-URRUTY, J.B., and LEMARECHAL, C. Convex Analysis and Minimization Algorithms, Vols. 1 and 2, Springer-Verlag, New York, NY, 1993.Google Scholar
- 12.CÁNOVAS, M.J., LÓPEZ, M.A., PARRA, J., TOLEDO, F.J., Distance to Solvability/Unsolvability in Linear Optimizations, SIAM Journal on Optimization, Vol. 16, pp. 629-649, 2006. Google Scholar