An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term

DOI10.1007/S10957-016-0895-0zbMATH Open1346.90568OpenAlexW2279948977MaRDI QIDQ306399FDOQ306399

Authors Mousaab Bouafia, Djamel Benterki, Adnan Yassine 

Publication date 31 August 2016

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-016-0895-0

zbMATH Keywords

interior point methodskernel functionlinear optimizationcomplexity bound

Mathematics Subject Classification ID

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

Recommendations

• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• 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 interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient bi-parameterized kernel function with a trigonometric barrier term
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

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 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
• An interior-point algorithm for linear optimization based on a new barrier 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 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

(29)

• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient bi-parameterized kernel function with a trigonometric barrier term
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• An efficient twice parameterized trigonometric kernel function for linear optimization
• An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
• A numerical implementation of an interior point methods for linear programming based on a new kernel function
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
• A generic kernel function for interior point methods
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
• Interior-point algorithm for linear programming based on a new descent direction
• An interior point approach for linear complementarity problem using new parametrized kernel function
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth 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
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• An interior point algorithm for solving linear optimization problems using a new trigonometric 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
• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
• A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function

This page was built for publication: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term

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