TARU PUBLICATIONS
Author

Dj. Benterki

Department of Mathematics, Faculty of Sciences, Laboratory of Fundamental and Numerical Mathematics, Ferhat Abbas University, Setif, 19000, Algeria

Published papers
5
Citations
0
Views
898
Downloads
384

Publications

5 papers
Open Access Research Article·pp. 437–453·Vol. 47, Issue 2Feb 2026

Interior-point method for CQP problems employing a novel trigonometric kernel function

I. Touil, W. Chikouche, Dj. Benterki

Published Online: 31 Mar 2025DOI: 10.47974/JIOS-1464

In this paper: We introduce a primal-dual interior-point approach to address convex quadratic programming dilemmas, utilizing a novel class of efficient parametric kernel functions. Using basic analytical tools, we...

AbstractReferencesFull Text PDF (316 KB)Views: 122Downloads: 71Citations: 0
Open Access Research Article·pp. 1–15·Vol. 47, Issue 1Jan 2026

Solving a quadratic fractional problem via a new quadratic formulation

Bennani Ahlem, Dj. Benterki

Published Online: 03 Feb 2025DOI: 10.47974/JIOS-1224

In this paper: We present two different techniques for solving a quadratic fractional program. The first one uses Taylor’s development which makes it possible to transform the quadratic fractional programming proble...

AbstractReferencesFull Text PDF (219 KB)Views: 249Downloads: 95Citations: 0
Open Access Research Article·pp. 99–117·Vol. 47, Issue 1Jan 2026

Efficient descent direction of a primal-dual interior point algorithm for convex quadratic optimization

Billel Zaoui, Dj. Benterki, Samia Khelladi

Published Online: 03 Feb 2025DOI: 10.47974/JIOS-1463

In this paper: We introduce a new interior-point method for solving convex quadratic programming under full-Newton step. The method involves an equivalent algebraic transformation applied to the system defining the...

AbstractReferencesFull Text PDF (301 KB)Views: 188Downloads: 63Citations: 0
Open Access Research Article·pp. 677–685·Vol. 45, Issue 3Apr 2024

A penalty method for linear programming

Linda Menniche, Dj. Benterki, Bachir Merikhi

Published Online: 27 Apr 2024DOI: 10.47974/JIOS-1340

In this paper: A logarithmic penalty method for linear optimization problem with a new approximate function is analyzed. The function addressed makes it possible to offer a displacement-step without major difficulti...

AbstractReferencesFull Text PDF (179 KB)Views: 191Downloads: 80Citations: 0
Open Access Research Article·pp. 699–715·Vol. 45, Issue 3Apr 2024

Efficient one-parameter family of conjugate gradient methods

Samia Khelladi, Dj. Benterki

Published Online: 27 Apr 2024DOI: 10.47974/JIOS-1354

In this paper: We present an efficient one-parameter family of conjugate gradient methods for unconstrained optimization problems. These methods are defined using a combination of the Polak-Ribiere-Polyak method and...

AbstractReferencesFull Text PDF (282 KB)Views: 148Downloads: 75Citations: 0