Error bounds for inconsistent linear inequalities and programs

For any system of linear inequalities, consistent or not, the norm of the violations of the inequalities by a given point, multiplied by a condition constant that is independent of the point, bounds the distance between the point and the nonempty set of points that minimize these violations. Similarly, for a dual pair of possibly infeasible linear programs, the norm of violations of primal-dual feasibility and primal-dual objective equality, when multiplied by a condition constant, bounds the distance between a given point and the nonempty set of minimizers of these violations. These results extend error bounds for consistent linear inequalities and linear programs to inconsistent systems.

[1]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[2]  Wu Li.  Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem , 1993, SIAM J. Optim..

[3]  Zhi-Quan Luo,et al.  Extension of Hoffman's Error Bound to Polynomial Systems , 1994, SIAM J. Optim..

[4]  Paul Tseng,et al.  Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set , 1993, SIAM J. Optim..

[5]  J. Pang.  More results on the convergence of iterative methods for the symmetric linear complementarity problem , 1986 .

[6]  J. Burkey,et al.  WEAK SHARP MINIMA IN MATHEMATICAL PROGRAMMING , 1993 .

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

[8]  Olvi L. Mangasarian,et al.  New Error Bounds for the Linear Complementarity Problem , 1994, Math. Oper. Res..

[9]  Paul Tseng,et al.  On a global error bound for a class of monotone affine variational inequality problems , 1992, Oper. Res. Lett..

[10]  Michael C. Ferris,et al.  Error bounds and strong upper semicontinuity for monotone affine variational inequalities , 1993, Ann. Oper. Res..

[11]  Olvi L. Mangasarian,et al.  New improved error bounds for the linear complementarity problem , 1994, Math. Program..

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

[13]  Paul Tseng,et al.  On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization , 1993, Math. Oper. Res..

[14]  Wu Li.  Error Bounds for Piecewise Convex Quadratic Programs and Applications , 1995 .

[15]  Olvi L. Mangasarian,et al.  Error bounds for nondegenerate monotone linear complementarity problems , 1990, Math. Program..

[16]  O. Mangasarian,et al.  Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .

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

[18]  W. Li.  Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines , 1995 .

[19]  P. Tseng,et al.  On the convergence of the coordinate descent method for convex differentiable minimization , 1992 .

[20]  Paul Tseng,et al.  Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem , 1992, SIAM J. Optim..

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

[22]  Jong-Shi Pang,et al.  Inexact Newton methods for the nonlinear complementarity problem , 1986, Math. Program..

[23]  O. Mangasarian.  Global error bounds for monotone affine variational inequality problems , 1992 .

[24]  Olvi L. Mangasarian,et al.  Error bounds for monotone linear complementarity problems , 1986, Math. Program..

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

[26]  O. Mangasarian,et al.  Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs , 1988 .

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