Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 710158, 11 pages
http://dx.doi.org/10.1155/2014/710158
Research Article

Complexity Analysis of Primal-Dual Interior-Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier Term

1College of Advanced Vocational Technology, Shanghai University of Engineering Science, Shanghai 200437, China
2College of Fundamental Studies, Shanghai University of Engineering Science, Shanghai 201620, China
3Nesna University College, Mathematics Section, 8700 Nesna, Norway

Received 9 February 2014; Revised 15 May 2014; Accepted 18 May 2014; Published 15 June 2014

Academic Editor: Ngai-Ching Wong

Copyright © 2014 X. Z. Cai et al. 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. C. Roos, T. Terlaky, and J.-Ph. Vial, Theory and Algorithms for Linear Optimization. An Interior-Point Approach, Theory and Algorithms For Linear Optimization, Springer, John Wiley & Sons, Chichester, UK, 1st edition, 1997.
  2. J. Peng, C. Roos, and T. Terlaky, “Self-regular functions and new search directions for linear and semidefinite optimization,” Mathematical Programming B, vol. 93, no. 1, pp. 129–171, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Q. Bai, M. El Ghami, and C. Roos, “A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization,” SIAM Journal on Optimization, vol. 15, no. 1, pp. 101–128, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. Q. Bai, Kernel Function-Based Interior-Point Algorithms For Conic Optimization, Science Press, Beijing, China, 2010.
  5. M. El Ghami, A Kernel Function Approach For Interior Point Methods: Analysis and Implementation, LAP Lambert Academic, Germany, 2011.
  6. M. El Ghami, Z. A. Guennoun, S. Bouali, and T. Steihaug, “Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term,” Journal of Computational and Applied Mathematics, vol. 236, no. 15, pp. 3613–3623, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. M. R. Peyghami, S. F. Hafshejani, and L. Shirvani, “Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function,” Journal of Computational and Applied Mathematics, vol. 255, no. 1, pp. 74–85, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. M. R. Peyghami and S. F. Hafshejani, “Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function,” Numerical Algorithms, 2014. View at Publisher · View at Google Scholar
  9. K. Amini and A. Haseli, “A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods,” ANZIAM Journal, vol. 49, no. 2, pp. 259–270, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Q. Bai, G. Lesaja, C. Roos, G. Q. Wang, and M. El Ghami, “A class of large-update and small-update primal-dual interior-point algorithms for linear optimization,” Journal of Optimization Theory and Applications, vol. 138, no. 3, pp. 341–359, 2008. View at Publisher · View at Google Scholar · View at Scopus