Interior-point algorithm for linear optimization based on a new trigonometric kernel function
From MaRDI portal
Publication:1785406
DOI10.1016/j.orl.2015.06.013zbMath1408.90318OpenAlexW2194768692MaRDI QIDQ1785406
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.06.013
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)
Related Items (19)
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term ⋮ 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 ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ 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 ⋮ 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 ⋮ A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions ⋮ 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 ⋮ 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
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- On the Implementation of a Primal-Dual Interior Point Method
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
This page was built for publication: Interior-point algorithm for linear optimization based on a new trigonometric kernel function
