Approximations to Solutions to Systems of Linear Inequalities

DOI10.1137/S0895479892237744zbMath0830.15016OpenAlexW1964995199MaRDI QIDQ4835420

Osman Güler, Alan J. Hoffman, Uriel G. Rothblum

Publication date: 5 February 1996

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479892237744

zbMATH Keywords

systems of linear inequalitieslinear programming dualityHoffman's inequality

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items (20)

Error bounds for analytic systems and their applications ⋮ Error bounds for mixed integer nonlinear optimization problems ⋮ Error bounds in mathematical programming ⋮ Bounds on the objective value of feasible roundings ⋮ Faster first-order primal-dual methods for linear programming using restarts and sharpness ⋮ An easily computable upper bound on the Hoffman constant for homogeneous inequality systems ⋮ Weak sharp minima for piecewise linear multiobjective optimization in normed spaces ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ Error bounds for inequality systems defining convex sets ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces ⋮ Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities ⋮ Towards a deeper geometric, analytic and algorithmic understanding of margins ⋮ A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution ⋮ Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems ⋮ Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming ⋮ Hoffman's least error bounds for systems of linear inequalities ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces ⋮ Error bounds for mixed integer linear optimization problems

This page was built for publication: Approximations to Solutions to Systems of Linear Inequalities