An efficient parameterized logarithmic kernel function for linear optimization
- 91 Downloads
The introduction of kernel function in primal-dual interior point methods represents not only a measure of the distance between the iterate and the central path, but also plays an important role in the amelioration of the computational complexity of an interior point algorithm. In this work, we present a primal-dual interior point method for linear optimization problems based on a new kernel function with an efficient logarithmic barrier term. We derive the complexity bounds for large and small-update methods respectively. We obtain the best known complexity bound for large-update given by Peng et al., which improves significantly the so far obtained complexity results based on a logarithmic kernel function given by El Ghami et al. The results obtained in this paper are the first with respect to the kernel function with a logarithmic barrier term.
KeywordsLinear optimization Kernel function Interior point methods Complexity bound
The authors are very grateful and would like to thank the anonymous referees for their suggestions and helpful comments which significantly improved the presentation of this paper.
- 1.Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, vol. 4, pp. 373–395 (1984)Google Scholar
- 5.El Ghami, M.: New Primal-Dual Interior-Point Methods Based on Kernel Functions. PhD Thesis, TU Delft, The Netherlands (2005)Google Scholar
- 16.Cai, X.Z., Wang, G.Q., El Ghami, M., Yue, Y.J.: Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric Kernel function with a trigonometric barrier term. Abstr. Appl. Anal., pages Art. ID 710158, 11, (2014)Google Scholar
- 19.Bai, Y. Q., Roos, C.: A primal-dual interior point method based on a new kernel function with linear growth rate. In: Proceedings of the 9th Australian Optimization Day, Perth, Australia (2002)Google Scholar
- 21.Sonnevend, G.: An “analytic center” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa, A., Szelezsan, J., Strazicky, B. (eds.) System Modelling and Optimization: Proceedings of the 12th IFIP-Conference, Budapest, Hungary, 1985, Lecture Notes in Control and Inform. Sci, vol. 84, pp. 866–876. Springer, Berlin (1986)Google Scholar