Volume 7, Issue 4 (Vol. 7,No. 4, 2021)                   mmr 2021, 7(4): 749-763 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Mahdavi-Amiri N, Kheirfam B. A full-modified-Newton step infeasible interior-point method for monotone linear complementarity problem. mmr 2021; 7 (4) :749-763
URL: http://mmr.khu.ac.ir/article-1-2744-en.html
1- Sharif University of Technology , nezamm@sharif.edu
2- Shahid Madani University of Azarbaijan
Abstract:   (804 Views)
By using a new search direction, we propose an infeasible
interior-point method for monotone linear complementarity problem. The
algorithm uses only one feasibility step in each iteration, and we prove that
it suffices in order to obtain a polynomial-time method. The iteration bound
coincides with the currently best iteration bound for linear complementarity
problems. Moreover, the numerical results show that the new algorithm has
a good performance.
Full-Text [PDF 798 kb]   (179 Downloads)    
Type of Study: S | Subject: alg
Received: 2018/02/10 | Revised: 2022/11/15 | Accepted: 2020/06/8 | Published: 2022/03/29 | ePublished: 2022/03/29

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2024 CC BY-NC 4.0 | Mathematical Researches

Designed & Developed by : Yektaweb