A Unified Analysis of Hoffman's Bound via Fenchel Duality

In 1952, Hoffman showed that the distance from any point to the solution set of a linear system is bounded above by a constant times the norm of the residual. Subsequently, this bound has been studied extensively and has found many practical uses. In this paper, we consider an extension of Hoffman’s bound to a partially infinite-dimensional setting in which the norm defining the distance is replaced by a positively homogeneous convex function and the linear system is replaced by a convex inclusion of the form $Ax - a \in K$, where A is a continuous linear operator from some normed linear space into $\mathbf{R}^m ,a$ is an element of the range space of A, and K is a nonempty closed convex cone in $\mathbf{R}^m $. When specialized to the finite-dimensional case, we unify and extend many existing results on Hoffman’s bound. Our analysis is based on the use of Fenchel duality to express the distance as the supremum of a certain concave function over a bounded subset of the polar of K. Much of our analysis als...

[1]  Diethard Klatte,et al.  Error bounds for solutions of linear equations and inequalities , 1995, Math. Methods Oper. Res..

[2]  O. Mangasarian A Condition Number for Linear Inequalities and Linear Programs. , 1981 .

[3]  Paul Tseng,et al.  On the convergence of the exponential multiplier method for convex programming , 1993, Math. Program..

[4]  Alfred Auslender,et al.  Global Regularity Theorems , 1988, Math. Oper. Res..

[5]  Hui Hu,et al.  On approximate solutions of infinite systems of linear inequalities , 1989 .

[6]  Paul C. Rosenbloom Quelques classes de problèmes extrémaux. II , 1951 .

[7]  Jim Burke,et al.  A Gauss-Newton Approach to Solving Generalized Inequalities , 1986, Math. Oper. Res..

[8]  O. Mangasarian,et al.  A variable-complexity norm maximization problem , 1986 .

[9]  O. Güler Augmented Lagrangian algorithms for linear programming , 1992 .

[10]  Alvaro R. De Pierro,et al.  On the convergence properties of Hildreth's quadratic programming algorithm , 1990, Math. Program..

[11]  James E. Falk,et al.  Optimization by Vector Space Methods (David G. Luenberger) , 1970 .

[12]  Jean-Louis Goffin,et al.  The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[13]  P. Tseng,et al.  On the linear convergence of descent methods for convex essentially smooth minimization , 1992 .

[14]  Vaithilingam Jeyakumar,et al.  Duality and infinite dimensional optimization , 1990 .

[15]  Yin Zhang,et al.  On the convergence of the iteration sequence in primal-dual interior-point methods , 1995, Math. Program..

[16]  Uriel G. Rothblum,et al.  Approximations to Solutions to Systems of Linear Inequalities , 1995, SIAM J. Matrix Anal. Appl..

[17]  William J. Cook,et al.  Sensitivity theorems in integer linear programming , 1986, Math. Program..

[18]  Jonathan M. Borwein,et al.  Partially finite convex programming, Part I: Quasi relative interiors and duality theory , 1992, Math. Program..

[19]  A. Hoffman On approximate solutions of systems of linear inequalities , 1952 .

[20]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[21]  Zhi-Quan Luo,et al.  Error bounds for analytic systems and their applications , 1994, Math. Program..

[22]  I. Singer,et al.  The distance to a polyhedron , 1992 .

[23]  S. M. Robinson Bounds for error in the solution set of a perturbed linear program , 1973 .

[24]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[25]  Wu Li Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs , 1994 .