Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 71, 2022 - Issue 15
106
Views
1
CrossRef citations to date
0
Altmetric
Research Article

An interior point approach for linear complementarity problem using new parametrized kernel function

, &
Pages 4403-4422 | Received 09 Oct 2018, Accepted 11 Jun 2021, Published online: 29 Jun 2021

References

  • Kojima M, Megiddo N, Noma T, et al. A unified approach to interior point algorithms for linear complementarity problems. Berlin: Springer-Verlag; 1991.
  • 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, editors. System Modelling and Optimization: Proceedings of the 12th IFIP-Conference; 1985; Budapest, Hungary. Berlin: Springer-Verlag; 1986. p. 866–876. (Lecture notes in control and information science; 84.
  • Megiddo N. Pathways to the optimal set in linear programming. In: Megiddo, N. editor. Progress in mathematical programming: interior point and related methods. New York: Springer; 1989. p. 131–158.
  • El Ghami M. New primal–dual interior-point methods based on kernel functions. Certificat d'Etudes approfondies Mathematiques (C.E.A). Universite Mohammed V, Rabat, Marokko; 2005.
  • Bai YQ, El Ghami M, Roos C. A comparative study of kernel functions for primal–dual interior point algorithms in linear optimization. SIAM J Optim. 2004;15:101–128.
  • Bouaafia M, Benterki D, Adnan Y. An efficient primal–dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. J Optim Theory Appl. 2016;170:528–545.
  • El Ghami M, Ivanov ID, Roos C, et al. A polynomial-time algorithm for LO based on generalized logarithmic barrier functions. Int J Appl Math. 2008;21:99–115.
  • Peng J, Roos C, Terlaky T. Self-regularity: a new paradigm for primal–dual interior point algorithms. Princeton, NJ: Princeton University Press; 2002.
  • Roos C, Terlaky T, Vial JP. Theory and algorithms for linear optimization, an interior point approach. Chichester: Wiley; 1997.
  • Peng J, Roos C, Terlaky T. A new and efficient large-update interior point method for linear optimization. J Comput Technol. 2001;6:61–80.
  • Bouaafia M, Benterki D, Adnan Y. An efficient parameterized logarithmic kernel function for linear optimization. Optim Lett. 2018;12:1079–1097.
  • Bai YQ, 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; 2000.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.