A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound

DOI10.2478/CM-2020-0003zbMath1465.90041OpenAlexW3018998277MaRDI QIDQ2038473

Benhadid Ayache, Saoudi Khaled

Publication date: 7 July 2021

Published in: Communications in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/cm-2020-0003

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 (3)

Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem

Cites Work

• An efficient parameterized logarithmic kernel function for linear optimization
• A new polynomial-time algorithm for linear programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound