摘要
This paper considers (Formula presented.) -Weighted Linear Complementarity Problems (WLCPs) and gives a novel corrector–predictor interior-point algorithm (IPA) based on an algebraic equivalent transformation function. The strict feasibility and convergence of our proposed method for (Formula presented.) -WLCP are established. In particular, we demonstrate that the iteration bound of the algorithm enjoys a polynomial complexity bound, which is comparable to the best available one for such existing IPAs. Finally, the proposed corrector–predictor IPA is applied to a small set of numerical examples to support the viability and efficiency of the algorithm and illustrate potential for the efficient implementation.
| 原文 | 英語 |
|---|---|
| 期刊 | Optimization |
| DOIs | |
| 出版狀態 | 接受/付印 - 2026 |
ASJC Scopus subject areas
- 控制和優化
- 管理科學與經營研究
- 應用數學
指紋
深入研究「A novel corrector–predictor interior-point algorithm for P*(κ)-weighted linear complementarity problems based on an AET function」主題。共同形成了獨特的指紋。引用此
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS