An efficient parameterized logarithmic kernel function for linear optimization

DOI10.1007/S11590-017-1170-5MaRDI QIDQ723500zbMATH OpenOpenAlexFDO

Authors Mousaab Bouafia, Djamel Benterki, Adnan Yassine

Publication date 31 July 2018

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-017-1170-5

zbMATH Keywords

interior point methodskernel functionlinear optimizationcomplexity bound

Mathematics Subject Classification ID

Linear programming (90C05) 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
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

Cites work

• 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?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A new and efficient large-update interior-point method for linear optimization
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel 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 linear optimization based on a new trigonometric kernel function
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

Cited in

(23)

• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• Closing the iteration gap in linear programming with a new kernel function
• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
• Extension of primal-dual interior point method based on a kernel function for linear fractional problem
• A primal-dual IPM algorithm for LO problem based on a new kernel function with a logarithmic barrier term
• New parameterized kernel functions for linear optimization
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
• Interior point methods for self-dual linear optimization problems based on kernel functions
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
• A new parametric kernel function based on p-generalized sigmoid function for the primal-dual interior point method of linear optimization
• An efficient twice parameterized trigonometric kernel function for linear optimization
• scientific article; zbMATH DE number 7551027 (Why is no real title available?)
• An interior point approach for linear complementarity problem using new parametrized kernel function
• An efficient bi-parametric hyperbolic kernel function yielding the best known iteration bounds for linear programming
• A fast dual algorithm for kernel logistic regression
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

This page was built for publication: An efficient parameterized logarithmic kernel function for linear optimization

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