# An easily computable upper bound on the Hoffman constant for homogeneous inequality systems

arXiv: https://arxiv.org/abs/2302.02193 · HTML: https://mlsanity.com/paper/2302.02193/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Feb 2023.

## Built on by (most cited first, 3 of 3)

- [OTTER: Effortless Label Distribution Adaptation of Zero-shot Models](https://mlsanity.com/paper/2404.08461/) (2024)
- [A Computational Tropical Geometry Framework for Neural Networks](https://mlsanity.com/paper/2405.20174/) (2024)
- [Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence](https://mlsanity.com/paper/2604.17067/) (2026)

## Abstract (arXiv)

Let A∈ ℝm× nsetminus 0 and P:=x:Ax≤ 0. This paper provides a procedure to compute an upper bound on the following homogeneous Hoffman constant: [ H0(A) := supu∈ ℝn setminus P fracdist(u,P)dist(Au, ℝm_-). ] In sharp contrast to the intractability of computing more general Hoffman constants, the procedure described in this paper is entirely tractable and easily implementable.