Two classes of modulus-based methods for solving linear complementarity problems
Year: 2024
Type: article
Abstract: This study focuses on developing efficient numerical methods to solve linear complementarity problems (LCP). There are many problems in various fields like engineering, economics, and science that lead to an LCP. Modulus-based methods are powerful computational tools for solving such problems. In this paper, the schemes for solving LCPs are based on modulus. The new methods utilize two initial guesses and update each of the initial guesses in separate steps. Convergence of new methods is expressed under special conditions when the system matrix is+ an H-matrix. Also, the presented numerical results confirm the efficiency of the new techniques compared to the modulus-based and two-step modulus-based methods.
Source: Filomat
DOI: 10.2298/fil2413495h
Authors: Maryam Bashirizadeh, Masoud Hajarian
Institution: Shahid Beheshti University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409696139
