Bounds for error in the solution set of a perturbed linear program

DOI10.1016/0024-3795(73)90007-4zbMath0283.90028OpenAlexW2066179689MaRDI QIDQ1844586

Publication date: 1973

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(73)90007-4

Mathematics Subject Classification ID

Linear programming (90C05) Linear equations (linear algebraic aspects) (15A06)

Related Items

Some perturbation theory for linear programming, Bounds for the solution set of linear complementarity problems, Error bounds for analytic systems and their applications, Error bounds for inconsistent linear inequalities and programs, Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Characterizations of stability of error bounds for convex inequality constraint systems, Least-norm linear programming solution as an unconstrained minimization problem, On the complexity of solving feasible systems of linear inequalities specified with approximate data, Error bounds for solutions of linear equations and inequalities, A note of Lipschitz constants for solutions of linear inequalities and equations, Stability in multicriteria optimization, About error bounds in metrizable topological vector spaces, On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems, A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems, An easily computable upper bound on the Hoffman constant for homogeneous inequality systems, A Measure Approximation for Distributionally Robust PDE-Constrained Optimization Problems, Unnamed Item, Stability analysis of a class of sparse optimization problems, Error bounds for inequality systems defining convex sets, The distance to a polyhedron, On the convergence of the affine-scaling algorithm, On a global error bound for a class of monotone affine variational inequality problems, The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth, On the convergence of the exponential multiplier method for convex programming, Largest dual ellipsoids inscribed in dual cones, The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs, Newton's method for nonlinear inequalities, The continuity of metric projections as functions of the data, BOUNDED RATIONALITY IN LONG-TERM PLANNING: A LINEAR PROGRAMMING APPROACH, Normed Convex Processes, New characterizations of Hoffman constants for systems of linear constraints, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, Lipschitz modulus in convex semi-infinite optimizationviad.c. functions, Lipschitz lower semicontinuity moduli for linear inequality systems, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Comments on: Stability in linear optimization and related topics. A personal tour, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem

Cites Work