Abstract
Abstract We present a path-following interior-point algorithm for solving the weighted linear complementarity problem from the implementation point of view. We studied two variants, which differ only in the method of updating the parameter which characterizes the central path. The implementation was done in the C++ programming language and the obtained numerical results prove the efficiency of the proposed method.
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.
