The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
From MaRDI portal
Publication:1260956
DOI10.1016/0024-3795(93)90125-8zbMath0809.65057MaRDI QIDQ1260956
Publication date: 29 August 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)90125-8
65K05: Numerical mathematical programming methods
90C05: Linear programming
15A09: Theory of matrix inversion and generalized inverses
15A39: Linear inequalities of matrices
Related Items
Calmness of partially perturbed linear systems with an application to the central path, Error bounds for solutions of linear equations and inequalities, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Lipschitzian Properties and Stability of a Class of First-Order Stochastic Dominance Constraints, Comments on: Stability in linear optimization and related topics. A personal tour, Error bounds for mixed integer linear optimization problems, Conditioning of linear-quadratic two-stage stochastic optimization problems, Quantitative stability of full random two-stage stochastic programs with recourse, Point-based neighborhoods for sharp calmness constants in linear programming, The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs, Calmness of the feasible set mapping for linear inequality systems, Lipschitz lower semicontinuity moduli for linear inequality systems, On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization, Error bounds in mathematical programming, Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations, A global error bound for quadratic perturbation of linear programs, Error estimates and Lipschitz constants for best approximation in continuous function spaces, A note of Lipschitz constants for solutions of linear inequalities and equations, Stability in linear optimization and related topics. A personal tour, New characterizations of Hoffman constants for systems of linear constraints, The \(d\)-majorization polytope, Error bounds for inequality systems defining convex sets, Calmness of the argmin mapping in linear semi-infinite optimization, An approach to calmness of linear inequality systems from Farkas lemma, Regularity modulus of arbitrarily perturbed linear inequality systems, Hoffman's least error bounds for systems of linear inequalities, Lipschitz modulus in convex semi-infinite optimizationviad.c. functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence properties of Hildreth's quadratic programming algorithm
- The distance to a polyhedron
- On the convergence of the coordinate descent method for convex differentiable minimization
- Bounds for error in the solution set of a perturbed linear program
- Sensitivity theorems in integer linear programming
- The Relaxation Method for Solving Systems of Linear Inequalities
- 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
- Two Consequences of the Transposition Theorem on Linear Inequalities
