An interior point approach for linear complementarity problem using new parametrized kernel function

DOI10.1080/02331934.2021.1945051OpenAlexW3173158625MaRDI QIDQ5055297

Khaled Saoudi, Ayache Benhadid, Fateh Merahi

Publication date: 13 December 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2021.1945051

zbMATH Keywords

kernel functioninterior-point methodslinear optimizationcomplexity bound

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term

Cites Work

• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• An efficient parameterized logarithmic kernel function for linear optimization
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interior point approach for linear complementarity problem using new parametrized kernel function