  


An algorithm to compute the Hoffman constant of a system of linear constraints
Javier Pena(jfpandrew.cmu.edu) Abstract: We propose a combinatorial algorithm to compute the Hoffman constant of a system of linear equations and inequalities. The algorithm is based on a characterization of the Hoffman constant as the largest of a finite canonical collection of easytocompute Hoffman constants. Our algorithm and characterization extend to the more general context where some of the constraints are easy to satisfy as in the case of box constraints. We highlight some natural connections between our characterizations of the Hoffman constant and Renegar's distance to illposedness for systems of linear constraints. Keywords: Hoffman constant, surjective mappings, norms Category 1: Convex and Nonsmooth Optimization (Convex Optimization ) Category 2: Combinatorial Optimization (Polyhedra ) Citation: Download: [PDF] Entry Submitted: 04/23/2018 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  