An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term
- 24 February 2016
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 170 (2) , 528-545
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Interior-point algorithm for linear optimization based on a new trigonometric kernel functionOperations Research Letters, 2015
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier termYugoslav Journal of Operations Research, 2015
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity functionNumerical Algorithms, 2014
- Complexity Analysis of Primal-Dual Interior-Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier TermAbstract and Applied Analysis, 2014
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel functionJournal of Computational and Applied Mathematics, 2014
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier termJournal of Computational and Applied Mathematics, 2012
- An interior-point algorithm for linear optimization based on a new barrier functionApplied Mathematics and Computation, 2011
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming2006
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear OptimizationSIAM Journal on Optimization, 2004
- Pathways to the Optimal Set in Linear Programming1989