New characterizations of Hoffman constants for systems of linear constraints
From MaRDI portal
Publication:2020601
DOI10.1007/s10107-020-01473-6zbMath1465.90043arXiv1905.02894OpenAlexW3005125106MaRDI QIDQ2020601
Luis F. Zuluaga, Javier F. Peña, Juan Carlos Vera
Publication date: 23 April 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.02894
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)
Related Items
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems, Strongly regular points of mappings, About error bounds in metrizable topological vector spaces, An update-and-stabilize framework for the minimum-norm-point problem, Lipschitz-like property for linear constraint systems, Robust and continuous metric subregularity for linear inequality systems, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Lipschitz upper semicontinuity in linear optimization via local directional convexity, An easily computable upper bound on the Hoffman constant for homogeneous inequality systems, The condition number of a function relative to a set, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
Uses Software
Cites Work
- Unnamed Item
- Error bounds for mixed integer linear optimization problems
- An SOS1-based approach for solving MPECs with a natural gas market application
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Some proximity and sensitivity results in quadratic integer programming
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- 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
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Error bounds in mathematical programming
- A characterization of the distance to infeasibility under block-structured perturbations
- Complexity of convex optimization using geometry-based measures and a reference point
- A simplified view of first order methods for optimization
- A unified approach to error bounds for structured convex optimization problems
- Bounds for error in the solution set of a perturbed linear program
- Linear programming, complexity theory and elementary functional analysis
- Algorithms for linear programming with linear complementarity constraints
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Linear convergence of first order methods for non-strongly convex optimization
- Ill-Conditioned Convex Processes and Conic Linear Systems
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
- Towards a deeper geometric, analytic and algorithmic understanding of margins
- Condition
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Global Error Bounds for Convex Conic Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- 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
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- A Coordinate-Free Condition Number for Convex Programming
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- The Structured Distance to Ill-Posedness for Conic Systems
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
