An efficient parameterized logarithmic kernel function for linear optimization
From MaRDI portal
Publication:723500
DOI10.1007/s11590-017-1170-5zbMath1423.90135OpenAlexW2736748366MaRDI QIDQ723500
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
Related Items
An interior point approach for linear complementarity problem using new parametrized kernel function, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Unnamed Item, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, 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 efficient twice parameterized trigonometric kernel function for linear optimization, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
Cites Work
- 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
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- 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
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
