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.2022003MaRDI QIDQ6107947zbMATH OpenOpenAlexFDO

Authors Ayache Benhadid, Fateh Merahi

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

complexity boundinterior point methodskernel functionlinear optimization

Mathematics Subject Classification ID

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

Recommendations

• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• An efficient parameterized logarithmic kernel function for linear optimization

Cites work

• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A new and efficient large-update interior-point method for linear optimization
• A new class of polynomial primal-dual methods 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
• A new parametric kernel function with a trigonometric barrier term for P_*()-linear complementarity problems
• A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP
• A new polynomial-time algorithm for linear programming
• A new primal-dual interior-point algorithm for convex quadratic optimization
• An efficient parameterized logarithmic kernel function for linear optimization
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• An interior point approach for linear complementarity problem using new parametrized kernel function
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• 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
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• scientific article; zbMATH DE number 5289787 (Why is no real title available?)
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Self-regular functions and new search directions for linear and semidefinite optimization

Cited in

(13)

• The accuracy of interior-point methods based on kernel functions
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
• A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
• scientific article; zbMATH DE number 7551027 (Why is no real title available?)
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• New parameterized kernel functions for linear optimization
• An efficient parameterized logarithmic kernel function for linear optimization
• A new parametric kernel function based on p-generalized sigmoid function for the primal-dual interior point method of linear optimization
• New interior-point methods for linear optimization problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107947)