In this paper, we present a new barrier function for primal–dual interior-point methods in linear optimization. The proposed kernel function has a ...
Primal-dual interior-point method(IPM) is one of the most efficient numerical methods for solving large classes of optimization problems and highly ...
Apr 21, 2023 · In this paper, we propose a path-following interior-point method (IPM) for solving linear optimization (LO) problems based on a new kernel function (KF).
Oct 22, 2024 · We present a simplified analysis to obtain the complexity of generic interior point methods based on the proximity functions induced by these ...
The IPM is based on the barrier functions that are defined by a large class of univariate functions called eligible kernel function which have recently been ...
Missing: algorithms | Show results with:algorithms
We propose a new primal-dual interior-point algorithm based on a new kernel function for linear optimization problems. New search directions and proximity ...
In this paper, we present a new primal–dual interior-point algorithm for linear optimization based on a trigonometric kernel function.
In this paper we generalize the analysis presented in the above paper for P*(κ) Linear Complementarity Problems (LCPs). The analysis for LCPs deviates ...
This class is fairly general; it includes classical logarithmic kernel function, prototype self-regular kernel function as well as non-self-regular functions,.
Oct 22, 2024 · We propose a new primal-dual interior-point algorithm based on a new kernel function for linear optimization problems. New search directions ...