Abstract
In this paper, we propose a full-Newton step infeasible interior-point algorithm (IPA) for solving linear optimization problems based on a new kernel function (KF). The latter belongs to the newly introduced hyperbolic type (Guerdouh et al. in An efficient primal-dual interior point algorithm for linear optimization problems based on a novel parameterized kernel function with a hyperbolic barrier term, 2021; Touil and Chikouche in Acta Math Appl Sin Engl Ser 38:44–67, 2022; Touil and Chikouche in Filomat 34:3957–3969, 2020). Unlike feasible IPAs, our algorithm doesn’t require a feasible starting point. In each iteration, the new feasibility search directions are computed using the newly introduced hyperbolic KF whereas the centering search directions are obtained using the classical KF. A simple analysis for the primal-dual infeasible interior-point method (IIPM) based on the new KF shows that the iteration bound of the algorithm matches the currently best iteration bound for IIPMs. We consolidate these theoretical results by performing some numerical experiments in which we compare our algorithm with the famous SeDuMi solver. To our knowledge, this is the first full-Newton step IIPM based on a KF with a hyperbolic barrier term.
Similar content being viewed by others
References
Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 339–347. Wiley, New York (1951)
Guerdouh, S., Chikouche, W., Touil, I.: An efficient primal-dual interior point algorithm for linear optimization problems based on a novel parameterized kernel function with a hyperbolic barrier term. halshs-03228790 (2021)
Kantorovich, L.V.: Mathematical methods in the organization and planning of production. Publication House of the Leningrad State University, 1939. Transl. Manag. Sci. 6, 366–422 (1960)
Karmarkar, N. K.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing. 4, 373–395 (1984)
Kheirfam, B., Haghighi, M.: A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function. Optimization 65(4), 841–857 (2016)
Kheirfam, B., Haghighi, M.: A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps. Numer. Algorithms 85, 59–75 (2020)
Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Math. Program, pp. 29–47. Springer, New York (1989)
Liu, Z., Sun, W.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46(2), 173–188 (2007)
Liu, Z., Sun, W., Tian, F.: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function. Appl. Math. Optim. 60, 237–251 (2009)
Lustig, I.J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1–3), 145–162 (1990)
Mansouri, H., Roos, C.: Simplified \({\cal{O} }(nL)\) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519–530 (2007)
Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575–601 (1992)
Monteiro, R.D., Adler, I.: Interior path following primal-dual algorithms. Part I: Linear programming. Math. Program. 44(1), 27–41 (1989)
Moslemi, M., Kheirfam, B.: Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function. Optim. Lett. 13, 127–145 (2019)
Rigó, P.R., Darvay, Z.: Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier. Comput. Optim. Appl. 71, 483–508 (2018)
Roos, C.: A full-Newton step \({\cal{O} }(n)\) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110–1136 (2006)
Roos, C., Terlaky, T.J., Vial, Ph.: Theory and Algorithms for Linear Optimization. An Interior Point Approach. Wiley, Chichester (1997)
Salahi, M., Peyghami, M.R., Terlaky, T.: New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. Eur. J. Oper. Res. 186(2), 466–485 (2008)
Touil, I., Chikouche, W.: Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems. Acta Math. Appl. Sin. Engl. Ser. 38, 44–67 (2022)
Touil, I., Chikouche, W.: Primal-dual interior point methods for semidefinite programming based on a new type of kernel functions. Filomat 34(12), 3957–3969 (2020)
Acknowledgements
This work has been supported by the general direction of scientific research and technological development (DGRSDT) under project PRFU No. C00L03UN180120220008. Algeria. The authors would like to thank the anonymous reviewers for the valuable comments and suggestions which improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
No conflict of interest was reported by the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Guerdouh, S., Chikouche, W. & Kheirfam, B. A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term. J. Appl. Math. Comput. 69, 2935–2953 (2023). https://doi.org/10.1007/s12190-023-01858-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-023-01858-8
Keywords
- Linear optimization
- Infeasible interior-point methods
- Kernel function
- Full-Newton step
- Complexity analysis