Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2020

11.09.2019 | Original Research

An interior point method for \(P_{*}(\kappa )\)-horizontal linear complementarity problem based on a new proximity function

verfasst von: Sajad Fathi Hafshejani, Alireza Fakharzadeh Jahromi

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Kernel functions play an important role in the design and complexity analysis of interior point algorithms for solving convex optimization problems. They determine both search directions and the proximity measure between the iterate and the central path. In this paper, we introduce a primal-dual interior point algorithm for solving \(P_*(\kappa ) \)-horizontal linear complementarity problems based on a new kernel function that has a trigonometric function in its barrier term. By using some simple analysis tools, we present some properties of the new kernel function. Our analysis shows that the algorithm meets the best known complexity bound i.e., \(O\left( (1+2\kappa )\sqrt{n}\log n\log \frac{n}{\varepsilon }\right) \) for large-update methods. Finally, we present some numerical results illustrating the performance of the algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for \(P_*(\kappa )\)-horizontal linear complementarity problems. Numer. Algorithms 63(2), 385–398 (2013)MathSciNetCrossRef Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for \(P_*(\kappa )\)-horizontal linear complementarity problems. Numer. Algorithms 63(2), 385–398 (2013)MathSciNetCrossRef
2.
Zurück zum Zitat Asadi, S., Mansouri, H., Zangiabadi, M.: A class of path-following interior-point methods for \(P_*(\kappa )\)-horizontal linear complementarity problems. J. Oper. Res. Soc. China 3(1), 17–30 (2015)MathSciNetCrossRef Asadi, S., Mansouri, H., Zangiabadi, M.: A class of path-following interior-point methods for \(P_*(\kappa )\)-horizontal linear complementarity problems. J. Oper. Res. Soc. China 3(1), 17–30 (2015)MathSciNetCrossRef
3.
Zurück zum Zitat Asadi, S., Zangiabadi, M., Mansouri, H.: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa )\)-horizontal linear complementarity problems based on a kernel function. J. Appl. Math. Comput. 50(1), 15–37 (2016)MathSciNetCrossRef Asadi, S., Zangiabadi, M., Mansouri, H.: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa )\)-horizontal linear complementarity problems based on a kernel function. J. Appl. Math. Comput. 50(1), 15–37 (2016)MathSciNetCrossRef
4.
Zurück zum Zitat Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101–128 (2004)MathSciNetCrossRef Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101–128 (2004)MathSciNetCrossRef
5.
Zurück zum Zitat Bouafia, M., Benterki, D., Yassine, A.: 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. 170(2), 528–545 (2016)MathSciNetCrossRef Bouafia, M., Benterki, D., Yassine, A.: 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. 170(2), 528–545 (2016)MathSciNetCrossRef
6.
Zurück zum Zitat Cai, X., Wang, G., Zhang, Z.: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier. Numer. Algorithims 62, 289–306 (2013)MathSciNetCrossRef Cai, X., Wang, G., Zhang, Z.: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier. Numer. Algorithims 62, 289–306 (2013)MathSciNetCrossRef
7.
Zurück zum Zitat El Ghami, M., Guennoun, Z.A., Boula, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236, 3613–3623 (2012)MathSciNetCrossRef El Ghami, M., Guennoun, Z.A., Boula, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236, 3613–3623 (2012)MathSciNetCrossRef
8.
Zurück zum Zitat El. Ghamia, M., Ivanov, I., Melissen, J.B.M., Roos, C., Steihaug, T.: A polynomial-time algorithm for linear optimization based on a new class of kernel functions. J. Comput. Appl. Math. 224(2), 500–513 (2009)MathSciNetCrossRef El. Ghamia, M., Ivanov, I., Melissen, J.B.M., Roos, C., Steihaug, T.: A polynomial-time algorithm for linear optimization based on a new class of kernel functions. J. Comput. Appl. Math. 224(2), 500–513 (2009)MathSciNetCrossRef
9.
Zurück zum Zitat El Ghami, M.: Primal-dual interior-point methods for \(P_*(\kappa )\)-linear complementarity problem based on a kernel function with a trigonometric barrier term. Optim. Theory Decis. Mak. Oper. Res. Appl. 31, 331–349 (2013)MathSciNetMATH El Ghami, M.: Primal-dual interior-point methods for \(P_*(\kappa )\)-linear complementarity problem based on a kernel function with a trigonometric barrier term. Optim. Theory Decis. Mak. Oper. Res. Appl. 31, 331–349 (2013)MathSciNetMATH
10.
Zurück zum Zitat Fathi-Hafshejani, S., Fatemi, M., Peyghami, M.R.: An interior-point method for \(P_*(\kappa )\)-linear complementarity problem based on a trigonometric kernel function. J. Appl. Math. Comput. 48, 111–148 (2015)MathSciNetCrossRef Fathi-Hafshejani, S., Fatemi, M., Peyghami, M.R.: An interior-point method for \(P_*(\kappa )\)-linear complementarity problem based on a trigonometric kernel function. J. Appl. Math. Comput. 48, 111–148 (2015)MathSciNetCrossRef
11.
Zurück zum Zitat Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 302–311 (1984) Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 302–311 (1984)
12.
Zurück zum Zitat Kheirfam, B.: A new search direction for full-newton stepinterior-point method in \(P_*(\kappa )\)-HLCP. J. Numer. Funct. Anal. Optim. 40(10), 1169–1181 (2019)MathSciNetCrossRef Kheirfam, B.: A new search direction for full-newton stepinterior-point method in \(P_*(\kappa )\)-HLCP. J. Numer. Funct. Anal. Optim. 40(10), 1169–1181 (2019)MathSciNetCrossRef
13.
Zurück zum Zitat Kheirfam, B.: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61, 659–680 (2012)MathSciNetCrossRef Kheirfam, B.: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61, 659–680 (2012)MathSciNetCrossRef
14.
Zurück zum Zitat Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29–47. Springer, New York (1989)CrossRef Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29–47. Springer, New York (1989)CrossRef
15.
Zurück zum Zitat Lee, Y.H., Cho, Y.Y., Cho, G.M.: Kernel function based interior-point methodsfor horizontal linear complementarity problems. J. Inequal. Appl. 2013, 215–229 (2013)CrossRef Lee, Y.H., Cho, Y.Y., Cho, G.M.: Kernel function based interior-point methodsfor horizontal linear complementarity problems. J. Inequal. Appl. 2013, 215–229 (2013)CrossRef
16.
Zurück zum Zitat Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for \(P_*(\kappa )\)-linear complementarity problems. SIAM J. Optim. 20, 3014–3039 (2010)MathSciNetCrossRef Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for \(P_*(\kappa )\)-linear complementarity problems. SIAM J. Optim. 20, 3014–3039 (2010)MathSciNetCrossRef
17.
Zurück zum Zitat Peng, J., Roos, C., Terlaky, T.: Self-Regularity a New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)MATH Peng, J., Roos, C., Terlaky, T.: Self-Regularity a New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)MATH
18.
Zurück zum Zitat Peyghami, M.R., Amini, K.: A kernel function based interior-point methods for solving \(P_{\ast }(\kappa )\)-linear complementarity problem. Acta Math. Sinica (Engl. Ser.) 26(9), 1761–1778 (2010)MathSciNetCrossRef Peyghami, M.R., Amini, K.: A kernel function based interior-point methods for solving \(P_{\ast }(\kappa )\)-linear complementarity problem. Acta Math. Sinica (Engl. Ser.) 26(9), 1761–1778 (2010)MathSciNetCrossRef
19.
Zurück zum Zitat Peyghami, M.R., Fathi-Hafshejani, S.: Complexity analysis of an interior point algorithm for linear optimization based on a new poriximity function. Numer. Algorithims 67, 33–48 (2016)CrossRef Peyghami, M.R., Fathi-Hafshejani, S.: Complexity analysis of an interior point algorithm for linear optimization based on a new poriximity function. Numer. Algorithims 67, 33–48 (2016)CrossRef
20.
Zurück zum Zitat Peyghami, M.R., Fathi-Hafshejani, S., Shirvani, L.: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255, 74–85 (2014)MathSciNetCrossRef Peyghami, M.R., Fathi-Hafshejani, S., Shirvani, L.: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255, 74–85 (2014)MathSciNetCrossRef
21.
Zurück zum Zitat Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Springer, NewYork (2005)MATH Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Springer, NewYork (2005)MATH
22.
Zurück zum Zitat Sonnevend, G.: An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prakopa, A., Szelezsan, J., Strazicky, B. (eds.) Lecture Notes in Control and Information Sciences, vol. 84, pp. 866–876. Springer, Berlin (1986) Sonnevend, G.: An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prakopa, A., Szelezsan, J., Strazicky, B. (eds.) Lecture Notes in Control and Information Sciences, vol. 84, pp. 866–876. Springer, Berlin (1986)
23.
Zurück zum Zitat Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithm for \(P_*(\kappa )\) horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248–263 (2009)MathSciNetCrossRef Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithm for \(P_*(\kappa )\) horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248–263 (2009)MathSciNetCrossRef
Metadaten
Titel
An interior point method for -horizontal linear complementarity problem based on a new proximity function
verfasst von
Sajad Fathi Hafshejani
Alireza Fakharzadeh Jahromi
Publikationsdatum
11.09.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2020
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-019-01284-9

Weitere Artikel der Ausgabe 1-2/2020

Journal of Applied Mathematics and Computing 1-2/2020 Zur Ausgabe