Djamel Benterki

23 papers Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the solution of Dolichobrachistochrone differential game via dynamic programming approach.
J. Comput. Appl. Math.
Aicha Ghanem, Touffik Bouremani, Djamel Benterki
2024 J jnl
An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization.
J. Appl. Math. Comput.
Zaoui Billel, Djamel Benterki, Adnan Yassine
2024 J jnl
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization.
Oper. Res. Lett.
Zaoui Billel, Djamel Benterki, Samia Khelladi
2024 J jnl
New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems.
Kybernetika
Youcef Elhamam Hemici, Samia Khelladi, Djamel Benterki
2024 J jnl
On Isaac's War Game of Attrition and Attack Using Dynamic Programming Approach.
Games
Safa Benghebrid, Touffik Bouremani, Djamel Benterki
2024 J jnl
Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation.
CoRR
Aicha Kraria, Bachir Merikhi, Djamel Benterki
2023 J jnl
Interior-point algorithm for linear programming based on a new descent direction.
RAIRO Oper. Res.
Zaoui Billel, Djamel Benterki, Aicha Kraria, Raouache Hadjer
2022 J jnl
Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation.
Int. J. Comput. Sci. Math.
Ahlem Bennani, Djamel Benterki
2022 J jnl
Optimal control of an epidemic by vaccination using dynamic programming approach.
Int. J. Math. Oper. Res.
Touffik Bouremani, Djamel Benterki, Yacine Slimani
2021 J jnl
Adaptive projection methods for linear fractional programming.
RAIRO Oper. Res.
Ahlem Bennani, Djamel Benterki, Hassina Grar
2018 J jnl
A new efficient short-step projective interior point method for linear programming.
Oper. Res. Lett.
Mousaab Bouafia, Djamel Benterki, Adnan Yassine
2018 J jnl
An efficient parameterized logarithmic kernel function for linear optimization.
Optim. Lett.
Mousaab Bouafia, Djamel Benterki, Adnan Yassine
2017 J jnl
A feasible primal-dual interior point method for linear semidefinite programming.
J. Comput. Appl. Math.
Imene Touil, Djamel Benterki, Adnan Yassine
2017 J jnl
A logarithmic barrier approach for linear programming.
J. Comput. Appl. Math.
Linda Menniche, Djamel Benterki
2016 J jnl
An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term.
J. Optim. Theory Appl.
Mousaab Bouafia, Djamel Benterki, Adnan Yassine
2016 J jnl
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function.
RAIRO Oper. Res.
Mousaab Bouafia, Djamel Benterki, Adnan Yassine
2015 — conf
A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function.
MCO (1)
Mousaab Bouafia, Djamel Benterki, Adnan Yassine
2015 J jnl
A relaxed logarithmic barrier method for semidefinite programming.
RAIRO Oper. Res.
Kettab Samia, Djamel Benterki
2015 J jnl
New effective projection method for variational inequalities problem.
RAIRO Oper. Res.
Hassina Grar, Djamel Benterki
2011 J jnl
Finding a strict feasible solution of a linear semidefinite program.
Appl. Math. Comput.
Djamel Benterki, Abdelkrim Keraghel
2008 J jnl
An improving procedure of the interior projective method for linear programming.
Appl. Math. Comput.
Djamel Benterki, A. Leulmi
2007 J jnl
A numerical feasible interior point method for linear semidefinite programs.
RAIRO Oper. Res.
Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi
2001 J jnl
A modified algorithm for the strict feasibility problem.
RAIRO Oper. Res.
Djamel Benterki, Bachir Merikhi