Bounds for the solution set of linear complementarity problems
نویسندگان
چکیده
منابع مشابه
Solution of linear complementarity problems using minimization with simple bounds
We deene a minimization problem with simple bounds associated to the horizontal linear complementarity problem (HLCP). When the HLCP is solvable, its solutions are the global minimizers of the associated problem. When the HLCP is feasible, we are able to prove a number of properties of the stationary points of the associated problem. In many cases, the stationary points are solutions of the HLC...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملComputation of Error Bounds for P-matrix Linear Complementarity Problems
We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix linear interval system. Moreover, for the involved matrix being an H-matrix with positive diagonals, an error bound can be found by solving a linear system of equations, which is sharper than the Mathias-Pang error bound. Pre...
متن کاملRemarks on the Numerical Solution of Certain Linear Complementarity Problems
In a recent paper, J. K. Aitchison and N. K. Upton have proposed a mathematical model of the behaviour of a cloud formed immediately after the sudden release of a pollutant, together with an algorithm for determining numerical solutions of the resulting system of constrained nonlinear equations and complementarity relations. This algorithm requires, at each step, the solution of a special Linea...
متن کاملOn the optimal solution of interval linear complementarity problems
We consider compact intervals [a, a] := {x ∈ IR : a ≤ x ≤ a} and denote the set of all such intervals by IR. We also write [a] instead of [a, a]. Furthermore, we consider matrices with an interval in each of its elements; i.e., [A,A] = ([aij ]) = ([aij , aij ]). We also write [A,A] := {A ∈ IRn×n : A ≤ A ≤ A}. By IRn×n we denote the set of all these so-called interval matrices. We also write [A]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90028-x