The distance to a polyhedron

DOI10.1016/0024-3795(92)90174-9zbMath0759.15008OpenAlexW1964879221MaRDI QIDQ1187387

S. Singh

Publication date: 23 July 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90174-9

zbMATH Keywords

estimatespolyhedrondistancenormed linear space

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Related Items

Error bounds for analytic systems and their applications, Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **, Existence and relaxation of solutions for a subdifferential inclusion with unbounded perturbation, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, Error bounds for solutions of linear equations and inequalities, Polyhedral sweeping processes with unbounded nonconvex-valued perturbation, Existence and relaxation of solutions to differential inclusions with unbounded right-hand side in a Banach space, A note of Lipschitz constants for solutions of linear inequalities and equations, Variational relation problems: existence of solutions and fixed points of contraction mappings, Error bounds for inequality systems defining convex sets, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Duality for optimization and best approximation over finite intersections, Hoffman's least error bounds for systems of linear inequalities, Error bounds for mixed integer linear optimization problems

Cites Work

• Bounds for error in the solution set of a perturbed linear program
• Sensitivity theorems in integer linear programming
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Quelques classes de problèmes extrémaux
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item