Hoffman's least error bounds for systems of linear inequalities

Journal of Global Optimization

Volumn 30, Issue 4, 2004, Pages 391-403

  Zheng, Xi Yin ^a   Ng, Kung Fu ^b  

^a YUNNAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Normed space; System of linear inequalities; The least error bound

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

LIPSCHITZ ERRORS; NORMED SPACE; SYSTEM OF LINEAR INEQUALITIES; THE LEAST ERROR BOUND;

LINEAR ALGEBRA;

EID: 14644391456     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10898-004-7020-x     Document Type: Article

References (12)

1. Bergthaller, C. and Singer, I. (1992), The distance to a polyhedron, Linear Algebra and its Applications, 169, 111-129.
2. Burke, J.V. and Ferris, M.C. (1993), Weak sharp minima in mathematical programming, SIAM. Control and Optim., 31, 1340-1359.
3. Burke, J.V. and Tseng, P. (1996), A unified analysis of Hoffman's bound via Fenchel duality, SIAM Journal on Optimization, 6, 265-282.
4. Guler, O., Hoffman, A.J. and Rothblum, U.G. (1995), Approximations to solutions to systems of linear inequalities, SIAM Journal on Matrix Analysis and Applications, 16, 688-696.
5. Hoffman, A.J. (1952), On approximate solutions of systems of linear inequalities, Journal of Research of the National Bureau of Standards, 49, 263-265.
6. Klatte, D. and Thiere, G. (1995), Error bounds for solutions of linear equations and inequalities, Mathematical Methods of Operations Research, 41, 191-214.
7. Lewis, A.S. and Pang, J.S. (1996), Error bounds for convex inequality systems, In: J.P. Couzeix (ed.), Proceedings of the Fifth Symposium on Generalized Convexity, Luminy-Marseille
8. Li, W. (1993), The sharp lipschitz constants for feasible and optimal solutions of a perturbed linear program, Linear Algebra and its Applications, 187, 15-40.
9. Mangasarian, O.L. and Shiau, T.H. (1986), A variable-complexity norm maximization problem, SIAM J. Alg. Discrete Methods, 7, 455-461.
10. Pang, J.S. (1997), Error bounds in mathematical programming, Mathematical Programming 79, 299-332.
11. Rockafellar, R.T. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.
12. Walkup, D.W. and Wets, R.J.B. (1969), Wets, A Lipschitzian characterization of convex polyhedra, Proceedings of the American Mathematical Society, 20, 167-173.