Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

DOI10.1051/ro/2015056zbMath1385.90017OpenAlexW2539825244MaRDI QIDQ2954362

Adnan Yassine, Djamel Benterki, Mousaab Bouafia

Publication date: 12 January 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015056

zbMATH Keywords

kernel functioninterior point methodslinear optimizationcomplexity bound

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Interior-point methods (90C51)

Related Items (9)

Interior-point algorithm for linear programming based on a new descent direction ⋮ Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function ⋮ A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function ⋮ An efficient parameterized logarithmic kernel function for linear optimization ⋮ A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound ⋮ An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term ⋮ An efficient twice parameterized trigonometric kernel function for linear optimization ⋮ A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• An interior-point algorithm for linear optimization based on a new barrier function
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Path-Following Methods for Linear Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: Complexity analysis of interior point methods for linear programming based on a parameterized kernel function