In this paper, we introduce for the first time a new eligible kernel function with a hyperbolic
barrier term for semidefinite programming (SDP). This add a new type of functions to the …

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). The latter differs from other …

In this paper, we present primal-dual interior-point methods (IPMs) for convex quadratic
programming (CQP) based on a new twice parameterized kernel function (KF) with a …

Interior-point methods (IPMs) for linear programming (LP) are generally based on the
logarithmic barrier function. Peng et al.(J. Comput. Technol. 6: 61–80, 2001) were the first to …

Nowadays, the Interior-Point Methods are one of the most useful tools for solving linear
optimization problems. These methods begun to gain popularity back in 1984 when …

Les méthodes de points intérieurs sont bien connues comme les plus efficaces pour
résoudre les problèmes d'optimisation. Ces méthodes possèdent une convergence …

In this work, we present an interior point algorithm for linear optimization problems based on
a kernel function which has a hyperbolic-logarithmic function in its barrier term. This kernel …

Les méthodes de points intérieurs sont bien connues commeles plus efficaces pour
résoudre les problèmes d'optimisation. Ces méthodes possèdent une convergence …

In this work, we propose a new type of kernel function for convex quadratic programming
problems. This kind was proposed for the first time by the authors themselves for semi …