Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term

References

• Karmarkar N. New polynomial-time algorithm for linear programming. Combinatorica. 1984;4:373–395. doi: 10.1007/BF02579150
   Web of Science ®Google Scholar
• Kojima M, Mizuno S, Yoshise A. A primal–dual interior point algorithm for linear programming. In: Megiddo N, editor. Progress in mathematical programming: interior point and related methods. New York: Springer Verlag; 1989. p. 29–47.
   Google Scholar
• 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-Verlag; 1998. p. 131–158.
   Google Scholar
• Nesterov YE, Nemirovskii AS. Interior point polynomial algorithms in convex programming. Philadelphia (PA): SIAM; 1994 (SIAM Studies in Applied Mathematics; vol. 13).
   Google Scholar
• Peng J, Roos C, Terlaky T. Self-regularity: a new paradigm for primal-dual interior-point algorithms. Princeton, NJ: Princeton University Press; 2002.
   Google Scholar
• 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. doi: 10.1137/S1052623403423114
   Web of Science ®Google Scholar
• El Ghami M, Guennoun ZA, Boula S, Steihaug T. Interior-point method for linear optimization based on a kernel function with a trigonometric barrier term. J Comput Appl Math. 2012;236:3613–3623. doi: 10.1016/j.cam.2011.05.036
   Web of Science ®Google Scholar
• Kheirfam B. Primal–dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer Algorithms. 2012;61:659–680. doi: 10.1007/s11075-012-9557-y
   Web of Science ®Google Scholar
• El Ghami M. Primal dual interior-point methods for -linear complementarity problem based on a kernel function with a trigonometric barrier term. Theory Decis Mak Oper Res Appl. 2013;31:331–349.
   Google Scholar
• Peyghami MR, Fathi-Hafshejani S, Shirvani L. Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J Comput Appl Math. 2014;255:74–85. doi: 10.1016/j.cam.2013.04.039
   Web of Science ®Google Scholar
• Peyghami MR, Fathi-Hafshejani S. Complexity analysis of an interior point algorithm for linear optimization based on a new poriximity function. Numer Algorithms. 2014;67:33–48. doi: 10.1007/s11075-013-9772-1
   Web of Science ®Google Scholar
• Fathi-Hafshejani S, Fatemi M, Peyghami MR. An interior-point method for -linear complementarity problem based on a trigonometric kernel function. J Appl Math Comput. 2015;48:111–128. doi: 10.1007/s12190-014-0794-1
   Web of Science ®Google Scholar
• 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. 2016;170(2):528–545. doi: 10.1007/s10957-016-0895-0
   Web of Science ®Google Scholar
• Fathi-Hafshejani S, Mansouri H, Peyghami MR. A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function. Optimization. 2016;65(6):1477–1496. doi: 10.1080/02331934.2016.1147034
   Web of Science ®Google Scholar
• Fathi-Hafshejani S, Fakharzadeh JA. An interior-point algorithm for semidefinite optimization based on a new parametric kernel function. J Nonlinear Funct Anal. 2018;2018:1–24. Article ID 14.
   Google Scholar
• Li X, Zhang M, Chen Y. An interior-point algorithm for -LCP based on a new trigonometric kernel function with a double barrier term. J Appl Math Comput. 2016; 53. doi: 10.1007/s12190-015-0978-3.
   Web of Science ®Google Scholar
• Li X, Zhang M. Interior-point algorithm for linear optimization based on a new trigonometric kernel function. Oper Res Lett. 2015;43:471–475. doi: 10.1016/j.orl.2015.06.013
   Web of Science ®Google Scholar
• Peyghami MR, Fathi-Hafshejani S, Chen S. A prima dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions. Oper Res Lett. 2016;44:319–323. doi: 10.1016/j.orl.2016.02.013
   Web of Science ®Google Scholar
• Fathi-Hafshejani S, Mansouri H, Peyghami MR. An interior-point algorithm for -linear complementarity problem based on a new trigonometric kernel function. J Math Model. 2017;5(2):171–197.
   Google Scholar
• Peyghami MR, Fathi-Hafshejani S. An interior point algorithm for solving convex quadratic semidefinite optimization problems using a new kernel function. Iranian J Math Sci Inform. 2017;12:131–152.
   Google Scholar
• Fathi-Hafshejani S, Fakharzadeh JA, Peyghami MR. A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions Optimization. J Math Program Oper Res. 2018;67(1):113–137.
   Google Scholar
• Monteiro RDC, Adler I. Interior-point path following primal–dual algorithms. Part I: linear programming. Math Program. 1989;44:27–41. doi: 10.1007/BF01587075
   Web of Science ®Google Scholar
• 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, editors. Lecture notes in control and information sciences, Vol. 84. Berlin: Springer-Verlag; 1986, p. 866–876
   Google Scholar
• Roos C, Terlaky T, Vial J-P. Theory and algorithms for linear optimization: an interior point approach. New York: Springer; 2005.
   Google Scholar
• Bai YQ, Wang GQ, Roos C. Primal–dual interior-point algorithms for second-order cone optimization based on kernel functions. Nonlinear Anal. 2009;70:3584–3602. doi: 10.1016/j.na.2008.07.016
   Web of Science ®Google Scholar
• Bai YQ, Roos C, El Ghami M. A primal–dual interior-point method for linear optimization based on a new proximity function. Optim Methods Softw. 2002;17:985–1008. doi: 10.1080/1055678021000090024
   Web of Science ®Google Scholar
• Meszaros C. Steplengths in interior-point algorithms of quadratic programming. Oper Res Lett. 1999;213:39–45. doi: 10.1016/S0167-6377(99)00028-0
   Web of Science ®Google Scholar