Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2011 (2011), Article ID 340192, 12 pages
http://dx.doi.org/10.1155/2011/340192
Research Article

An Improved Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems with √ 𝑂 ( 𝑛 𝐿 ) -Iteration Complexity

1School of Economics and Management, Wuhan University, Wuhan 430072, China
2School of Economics, Wuhan University of Technology, Wuhan 430070, China

Received 18 September 2011; Revised 23 November 2011; Accepted 24 November 2011

Academic Editor: Chong Lin

Copyright Β© 2011 Debin Fang and Qian Yu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. Karmarkar, β€œA new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  2. S. Mizuno, M. J. Todd, and Y. Ye, β€œOn adaptive-step primal-dual interior-point algorithms for linear programming,” Mathematics of Operations Research, vol. 18, no. 4, pp. 964–981, 1993. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  3. T. IllΓ©s, M. Nagy, and T. Terlaky, β€œA polynomial path-following interior point algorithm for general linear complementarity problems,” Journal of Global Optimization, vol. 47, no. 3, pp. 329–342, 2010. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  4. Y. Q. Bai, G. Lesaja, and C. Roos, β€œA new class of polynomial interior-point algorithms for linear complementary problems,” Pacific Journal of Optimization. An International Journal, vol. 4, no. 1, pp. 19–41, 2008. View at Google Scholar
  5. Y. Ye, O. GΓΌler, R. A. Tapia, and Y. Zhang, β€œA quadratically convergent O(nL)-iteration algorithm for linear programming,” Mathematical Programming, vol. 59, no. 2, pp. 151–162, 1993. View at Publisher Β· View at Google Scholar
  6. Y. Ye and K. Anstreicher, β€œOn quadratic and O(nL) convergence of a predictor-corrector algorithm for LCP,” Mathematical Programming, vol. 62, no. 3, pp. 537–551, 1993. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  7. J. Ji, F. A. Potra, and S. Huang, β€œPredictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,” Journal of Optimization Theory and Applications, vol. 85, no. 1, pp. 187–199, 1995. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  8. F. A. Potra, β€œThe Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path,” European Journal of Operational Research, vol. 143, no. 2, pp. 257–267, 2002. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  9. F. A. Potra, β€œA superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(nL)-iteration complexity,” Mathematical Programming A, vol. 100, no. 2, pp. 317–337, 2004. View at Publisher Β· View at Google Scholar
  10. J. Stoer, M. Wechs, and S. Mizuno, β€œHigh order infeasible-interior-point methods for solving sufficient linear complementarity problems,” Mathematics of Operations Research, vol. 23, no. 4, pp. 832–862, 1998. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  11. F. A. Potra, β€œAn O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence,” Annals of Operations Research, vol. 62, pp. 81–102, 1996. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  12. S. J. Wright, β€œA path-following interior-point algorithm for linear and quadratic problems,” Annals of Operations Research, vol. 62, pp. 103–130, 1996. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  13. W. Ai and S. Zhang, β€œAn O(nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP,” SIAM Journal on Optimization, vol. 16, no. 2, pp. 400–417, 2005. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  14. M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, β€œA unified approach to interior point algorithms for linear complementarity problems,” Lecture Notes in Computer Science, vol. 538, 1991. View at Google Scholar
  15. M. A. Noor, Y. J. Wang, and N. Xiu, β€œProjection iterative schemes for general variational inequalities,” Journal of Inequalities in Pure and Applied Mathematics, vol. 3, no. 3, pp. 1–8, 2002. View at Google Scholar Β· View at Zentralblatt MATH