Mathematics > Optimization and Control
[Submitted on 14 Aug 2021 (v1), last revised 23 Nov 2021 (this version, v2)]
Title:Bounded Homotopy Path Approach to Find the Solution of Linear Complementarity Problems
View PDFAbstract:In this article, we introduce a new homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of the linear complementarity problem. Earlier several authors attempted to propose homotopy functions based on original problems. We propose the homotopy function based on the Karush-Kuhn-Tucker condition of the corresponding quadratic programming problem. The proposed approach extends the processability of the larger class of linear complementarity problem and overcomes the limitations of other existing homotopy approaches. We show that the homotopy path approaching the solution is smooth and bounded with positive tangent direction of the homotopy path. Various classes of numerical examples are illustrated to show the effectiveness of the proposed algorithm and the superiority of the algorithm among other existing iterative methods.
Submission history
From: Arup Kumar Das [view email][v1] Sat, 14 Aug 2021 09:13:41 UTC (405 KB)
[v2] Tue, 23 Nov 2021 05:46:41 UTC (668 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.