A new polynomial-time algorithm for linear programming
Combinatorica
Pathways to the optimal set in linear programming
on Progress in Mathematical Programming: Interior-Point and Related Methods
Interior path following primal-dual algorithms. Part I: Linear programming
Mathematical Programming: Series A and B
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
SIAM Journal on Optimization
SIAM Journal on Optimization
Journal of Computational and Applied Mathematics
| Hi-index | 7.29 |
In this paper, we propose a new kernel function with trigonometric barrier term for primal-dual interior point methods in linear optimization. Using an elegant and simple analysis and under some easy to check conditions, we explore the worst case complexity result for the large update primal-dual interior point methods. We obtain the worst case iteration bound for the large update primal-dual interior point methods as O(n^2^3logn@e) which improves the so far obtained complexity results for the trigonometric kernel function in [M. El Ghami, Z.A. Guennoun, S. Boula, T. Steihaug, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, Journal of Computational and Applied Mathematics 236 (2012) 3613-3623] significantly.