On approximate solutions of infinite systems of linear inequalities
Considering a theorem of \textit{A. J. Hoffman} [J. Res. Nat. Bur. Standards 49, 263-265 (1952; MR 14,155)], regarding the existence of a solution for the finite consistent system \(A_ x\leq b\), this paper extends the results on approximate solutions on finite systems of linear inequalities to infinite systems of linear inequalities. It is shown that, for a given infinite system of linear inequalities (satisfying certain conditions), the Euclidean distance from a vector x to the solution set of the system is equivalent to the ``biggest violation by x of the system. Any vector ``x that ``almost satisfies the system is then ``enough close to a solution of the system. There are many practical, as well as theoretical problems that can be formulated as semifinite linear programs. Generally, it is very difficult to find an optimal solution in a finite number of steps. The algorithms for solving semifinite linear programming can only provide an approximate solution at each step. The problem is to stop the algorithm as soon as a satisfactory approximate solution is discovered.
- Approximations to Solutions to Systems of Linear Inequalities
- A relaxation method for solving systems with infinitely many linear inequalities
- scientific article; zbMATH DE number 3958598
- Best approximate solutions of inconsistent linear inequality systems
- An inexact approach to solving linear semi-infinite programming problems
- An Infinite Linear Program with a Duality Gap
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3632235 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Numerical treatment of a class of semi‐infinite programming problems
- The Relaxation Method for Linear Inequalities
- Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
- A globally convergent method for semi-infinite linear programming
- Stability in linear optimization and related topics. A personal tour
- Radius of robust global error bound for piecewise linear inequality systems
- scientific article; zbMATH DE number 3917573 (Why is no real title available?)
- On Finite-Rowed Systems of Linear Inequalities in Infinitely Many Variables. II
- Approximations to Solutions to Systems of Linear Inequalities
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- scientific article; zbMATH DE number 3206562 (Why is no real title available?)
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- Extension of the value function reformulation to multiobjective bilevel optimization
- Efficient randomized block Kaczmarz method for linear feasibility
- A note on the error bound at infinity for nonconvex inequality systems via asymptotic analysis
- Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Robust global error bounds for uncertain linear inequality systems with applications
This page was built for publication: On approximate solutions of infinite systems of linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121345)
