An Improved Predictor‐Corrector Interior‐Point Algorithm for Linear Complementarity Problems with O(nL)‐Iteration Complexity

Debin Fang and Qian Yu

Journal of Applied Mathematics, 2011, vol. 2011, issue 1

Abstract: This paper proposes an improved predictor‐corrector interior‐point algorithm for the linear complementarity problem (LCP) based on the Mizuno‐Todd‐Ye algorithm. The modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. It implies that the improved algorithm can converge faster than the MTY algorithm. The iteration complexity of the improved algorithm is proved to obtain O(nL) which is similar to the classical Mizuno‐Todd‐Ye algorithm. Finally, the numerical experiments show that our algorithm improved the performance of the classical MTY algorithm.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2011/340192

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2011:y:2011:i:1:n:340192

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().