An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
From MaRDI portal
Publication:306399
DOI10.1007/s10957-016-0895-0zbMath1346.90568OpenAlexW2279948977MaRDI QIDQ306399
Djamel Benterki, Mousaab Bouafia, 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
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Interior-point methods (90C51)
Related Items (22)
An interior point approach for linear complementarity problem using new parametrized kernel function ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions ⋮ 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 ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function ⋮ An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization ⋮ Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term ⋮ 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 parameterized logarithmic kernel function for linear optimization ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity 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 ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions ⋮ An efficient twice parameterized trigonometric kernel function for linear optimization ⋮ A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior-point methods for linear optimization based on a kernel function with a 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
- A new polynomial-time algorithm for linear programming
- 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
- 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
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
