an improved predictor-corrector interior-point algorithm for linear complementarity problems with โˆš๐‘‚(๐‘›๐ฟ)-iteration complexity

Clicks: 171
ID: 180412
2011
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score โ€” reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #56 of 357 articles by views in Chemico-biological interactions

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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 โˆš๐‘‚(๐‘›๐ฟ) 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.
Reference Key
fang2011journalan Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Debin Fang;Qian Yu
Journal Chemico-biological interactions
Year 2011
DOI
10.1155/2011/340192
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.