An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function

DOI10.2298/FIL2005471FOpenAlexW3128511594MaRDI QIDQ5089362

No author found.

Publication date: 19 July 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil2005471f

zbMATH Keywords

kernel functionlinear optimizationprimal-dual interior-point methodslarge-update methods

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• 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
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• An efficient parameterized logarithmic kernel function for linear optimization
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• 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
• Interior path following primal-dual algorithms. I: Linear programming
• A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
• 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
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function