Hoffman's least error bounds for systems of linear inequalities

DOI10.1007/S10898-004-7020-XMaRDI QIDQ2574102zbMATH OpenOpenAlexFDO

Authors Xi Yin Zheng, K. F. Ng

Publication date 16 November 2005

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-004-7020-x

zbMATH Keywords

normed spacesystem of linear inequalitiesthe least error bound

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48)

Recommendations

• Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
• scientific article; zbMATH DE number 1539031
• scientific article; zbMATH DE number 27650
• Error bounds for inequality systems defining convex sets
• Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces

Cites work

• A Lipschitzian Characterization of Convex Polyhedra
• A Unified Analysis of Hoffman’s Bound via Fenchel Duality
• A Variable-Complexity Norm Maximization Problem
• Approximations to Solutions to Systems of Linear Inequalities
• Convex Analysis
• Error bounds for solutions of linear equations and inequalities
• Error bounds in mathematical programming
• scientific article; zbMATH DE number 1328979 (Why is no real title available?)
• The distance to a polyhedron
• The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
• Weak Sharp Minima in Mathematical Programming

Cited in

(14)

• Slopes, error bounds and weak sharp Pareto minima of a vector-valued map
• New characterizations of Hoffman constants for systems of linear constraints
• scientific article; zbMATH DE number 51251 (Why is no real title available?)
• Extension of Hoffman’s Error Bound to Polynomial Systems
• scientific article; zbMATH DE number 1047604 (Why is no real title available?)
• scientific article; zbMATH DE number 1376813 (Why is no real title available?)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
• Efficient randomized block Kaczmarz method for linear feasibility
• Block matrix and tensor randomized Kaczmarz methods for linear feasibility problems
• The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
• Duality of Hoffman constants
• Sharp minima for multiobjective optimization in Banach spaces
• Weak sharp minima for piecewise linear multiobjective optimization in normed spaces

This page was built for publication: Hoffman's least error bounds for systems of linear inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2574102)