Abstract
This paper is concerned with iterative methods for the linear complementarity problem (LCP) of findingx and y in Rn such thatc+Dx+yź0, b-xź0, andxT(c+Dx+y)=yT(b-x)=0 whenb>0. This is the LCP (M, q) withM=(l 0D t), which is in turn equivalent to a linear variational inequality over a rectangle. This type of problem arises, for example, from quadratic programming (QP) problems with upper and lower bounds ifD is symmetric, and from multicommodity market equilibrium problems with institutional price controls imposed ifD is not necessarily symmetric. Iterative methods for the LCP (M, q) with symmetricM are well developed and studied using QP applications. For nonsymmetric cases withM being either an H-matrix with positive diagonals, or a Z-matrix, there exists a robust iterative method with guaranteed convergence. This paper extends this algorithm so that the LCP (M, q) withM=(l 0D t) which is neither symmetric, nor an H-matrix with positive diagonals, nor a Z-matrix, can be processed when onlyD notM satisfies such properties. The case whereD is nonsymmetric is explicitly discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
