Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- 1 October 2016
- journal article
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 50 (4-5) , 935-949
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- 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
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithmsActa Mathematica Sinica, English Series, 2009
- A polynomial-time algorithm for linear optimization based on a new class of kernel functionsJournal of Computational and Applied Mathematics, 2009
- Generic Primal-dual Interior Point Methods Based on a New Kernel FunctionRAIRO - Operations Research, 2008
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear OptimizationSIAM Journal on Optimization, 2004
- A polynomial-time algorithm for linear optimization based on a new simple kernel functionOptimization Methods and Software, 2003
- Self-regular functions and new search directions for linear and semidefinite optimizationMathematical Programming, 2002
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite BarrierSIAM Journal on Optimization, 2002
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992