An efficient twice parameterized trigonometric kernel function for linear optimization

DOI10.1007/S11081-019-09467-WMaRDI QIDQ779775zbMATH OpenOpenAlexWikidataFDO

Authors Mousaab Bouafia, Adnan Yassine

Publication date 14 July 2020

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11081-019-09467-w

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

• 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
• 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 algorithm for solving linear optimization problems using a new trigonometric kernel function
• Interior-point algorithm for linear optimization based on 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

Cites work

• 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 Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A new and efficient large-update interior-point method for linear optimization
• A new polynomial-time algorithm for linear programming
• 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
• 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 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
• New parameterized kernel functions for linear optimization
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term

Cited in

(5)

• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• scientific article; zbMATH DE number 7551027 (Why is no real title available?)
• 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 analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function

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

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