Error bounds for solutions of linear equations and inequalities

DOI10.1007/BF01432655zbMath0823.65055MaRDI QIDQ4837939

Gisbert Thiere, Diethard Klatte

Publication date: 24 October 1995

Published in: ZOR Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

error boundsquadratic programsHoffmann constants

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming ⋮ From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems ⋮ Best Lipschitz constants of solutions of quadratic programs ⋮ A note of Lipschitz constants for solutions of linear inequalities and equations ⋮ An approach to calmness of linear inequality systems from Farkas lemma ⋮ Linear convergence of first order methods for non-strongly convex optimization ⋮ 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 ⋮ Calmness of partially perturbed linear systems with an application to the central path ⋮ Error bounds for inequality systems defining convex sets ⋮ Quantitative stability of full random two-stage stochastic programs with recourse ⋮ Critical objective size and calmness modulus in linear programming ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Point-based neighborhoods for sharp calmness constants in linear programming ⋮ Calmness of the argmin mapping in linear semi-infinite optimization ⋮ The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs ⋮ Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Acceptable solutions and backward errors for tensor complementarity problems ⋮ Continuity of parametric mixed-integer quadratic programs and its application to stability analysis of two-stage quadratic stochastic programs with mixed-integer recourse ⋮ Calmness of the feasible set mapping for linear inequality systems ⋮ Risk-Averse Models in Bilevel Stochastic Linear Programming ⋮ Restarting the accelerated coordinate descent method with a rough strong convexity estimate ⋮ Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems ⋮ Lipschitz lower semicontinuity moduli for linear inequality systems ⋮ Hoffman's least error bounds for systems of linear inequalities ⋮ Comments on: Stability in linear optimization and related topics. A personal tour ⋮ Bilevel Linear Optimization Under Uncertainty ⋮ Error bounds for mixed integer linear optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exterior point algorithms for nearest points and convex quadratic programs
• Implicit functions and sensitivity of stationary points
• Error bounds for nondegenerate monotone linear complementarity problems
• A stable theorem of the alternative: An extension of the Gordan theorem
• The distance to a polyhedron
• The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• Bounds for error in the solution set of a perturbed linear program
• A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
• On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity
• Sensitivity theorems in integer linear programming
• Column generation in quadratic programming
• Some continuity properties of polyhedral multifunctions
• A critical index algorithm for nearest point problems on simplicial cones
• Stability in convex quadratic parametric programming
• Finding the nearest point in A polytope
• Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Error bounds for monotone linear complementarity problems
• A Lipschitzian Characterization of Convex Polyhedra
• On Quadratic Programming