Abstract
In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence of these algorithms.Numerical simulations and comparative results of the new approach are provided.Since the quadratic convex program and linear program can be written as (LCP), so it can be resolved thanks to our new approach.
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 callMore From: Journal of Numerical Analysis and Approximation Theory
Disclaimer: 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.
