An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- 29 March 2019
- journal article
- research article
- Published by Springer Nature in Optimization and Engineering
- Vol. 21 (1) , 107-129
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth termOptimization, 2018
- An efficient parameterized logarithmic kernel function for linear optimizationOptimization Letters, 2017
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel functionRAIRO - Operations Research, 2016
- An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier TermJournal of Optimization Theory and Applications, 2016
- 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
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier termJournal of Computational and Applied Mathematics, 2012
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrierNumerical Algorithms, 2012
- A polynomial-time algorithm for linear optimization based on a new class of kernel functionsJournal of Computational and Applied Mathematics, 2009
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear OptimizationSIAM Journal on Optimization, 2004
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite BarrierSIAM Journal on Optimization, 2002