An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
From MaRDI portal
Publication:6179881
DOI10.1007/s10589-023-00514-yarXiv2302.02193OpenAlexW4385708093MaRDI QIDQ6179881
Publication date: 18 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.02193
Cites Work
- Unnamed Item
- Unnamed Item
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- On scaled projections and pseudoinverses
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the complexity of approximating extremal determinants in matrices
- Bounds for error in the solution set of a perturbed linear program
- New characterizations of Hoffman constants for systems of linear constraints
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Hoffman's least error bounds for systems of linear inequalities
- On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Regularity and Stability for Convex Multivalued Functions
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Approximations to Solutions to Systems of Linear Inequalities
- Error bounds for solutions of linear equations and inequalities
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Normed Convex Processes
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
