Interior-point algorithm for linear programming based on a new descent direction

We present a full-Newton step feasible interior-point algorithm for linear optimization based on a new search direction. We apply a vector-valued function generated by a univariate function on a new type of transformation on the centering equations of the system which characterizes the central path. For this, we consider a new function ψ(t)=t 7/4 . Furthermore, we show that the algorithm finds the epsilon-optimal solution of the underlying problem in polynomial time. Finally, a comparative numerical study is reported in order to analyze the efficiency of the proposed algorithm.

[1]  Loubna Guerra.  A class of new search directions for full-NT step feasible interior point method in semidefinite optimization , 2022, RAIRO Oper. Res..

[2]  Y. Ye,et al.  An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization , 2022, 2209.01793.

[3]  T. Illés,et al.  Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique , 2021, Eur. J. Oper. Res..

[4]  B. Kheirfam,et al.  A new search direction for full-Newton step infeasible interior-point method in linear optimization , 2021, Croatian operational research review.

[5]  D. Benterki,et al.  A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function , 2020, Optimization.

[6]  B. Kheirfam.  A New Search Direction for Full-Newton Step Interior-Point Method in -HLCP , 2019, Numerical Functional Analysis and Optimization.

[7]  Zsolt Darvay,et al.  New method for determining search directions for interior-point algorithms in linear optimization , 2018, Optim. Lett..

[8]  Y. Ye,et al.  An ADMM-based interior-point method for large-scale linear programming , 2018, Optim. Methods Softw..

[9]  Zsolt Darvay,et al.  A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions , 2018 .

[10]  Djamel Benterki,et al.  Complexity analysis of interior point methods for linear programming based on a parameterized kernel function , 2016, RAIRO Oper. Res..

[11]  Zsolt Darvay,et al.  Complexity analysis of a full-Newton step interior-point method for linear optimization , 2016, Periodica Mathematica Hungarica.

[12]  Djamel Benterki,et al.  An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term , 2016, Journal of Optimization Theory and Applications.

[13]  Xin Li,et al.  Interior-point algorithm for linear optimization based on a new trigonometric kernel function , 2015, Oper. Res. Lett..

[14]  Behrouz Kheirfam,et al.  A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term , 2014 .

[15]  Trond Steihaug,et al.  Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term , 2012, J. Comput. Appl. Math..

[16]  Yan-Qin Bai,et al.  A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization , 2012, Journal of Optimization Theory and Applications.

[17]  Liang Fang,et al.  A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming , 2010 .

[18]  Yan-Qin Bai,et al.  A new primal-dual path-following interior-point algorithm for semidefinite optimization , 2009 .

[19]  B. Kheirfam.  A new full-NT step interior-point method for circular cone optimization , 2019 .

[20]  M. Reza Peyghami,et al.  Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function , 2014, J. Comput. Appl. Math..

[21]  M. Achache.  A PRIMAL-DUAL INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMS , 2012 .

[22]  Mohamed Achache,et al.  A new primal-dual path-following method for convex quadratic programming , 2006 .

[23]  Kees Roos,et al.  A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization , 2004, SIAM J. Optim..

[24]  Zsolt Darvay.  New Interior Point Algorithms in Linear Programming , 2003 .