Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term

DOI10.3934/naco.2022003zbMath1514.90158OpenAlexW4213279199MaRDI QIDQ6107947

Fateh Merahi, Ayache Benhadid

Publication date: 28 June 2023

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2022003

zbMATH Keywords

kernel functioninterior point methodslinear optimizationcomplexity bound

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• An efficient parameterized logarithmic kernel function for linear optimization
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• A new polynomial-time algorithm for linear programming
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An interior point approach for linear complementarity problem using new parametrized kernel function
• A new primal-dual interior-point algorithm for convex quadratic optimization

This page was built for publication: Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term