Djamel Benterki

According to our database, Djamel Benterki authored at least 20 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization.

Zaoui Billel, Djamel Benterki, Adnan Yassine

J. Appl. Math. Comput., June, 2024

Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization.

Zaoui Billel, Djamel Benterki, Samia Khelladi

Oper. Res. Lett., 2024

Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation.

Aicha Kraria, Bachir Merikhi, Djamel Benterki

CoRR, 2024

2023

Interior-point algorithm for linear programming based on a new descent direction.

Zaoui Billel, Djamel Benterki, Aicha Kraria, Raouache Hadjer

RAIRO Oper. Res., September, 2023

2022

Optimal control of an epidemic by vaccination using dynamic programming approach.

Touffik Bouremani, Djamel Benterki, Yacine Slimani

Int. J. Math. Oper. Res., 2022

Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation.

Ahlem Bennani, Djamel Benterki

Int. J. Comput. Sci. Math., 2022

2021

Adaptive projection methods for linear fractional programming.

Ahlem Bennani, Djamel Benterki, Hassina Grar

RAIRO Oper. Res., 2021

2018

A new efficient short-step projective interior point method for linear programming.

Mousaab Bouafia, Djamel Benterki, Adnan Yassine

Oper. Res. Lett., 2018

An efficient parameterized logarithmic kernel function for linear optimization.

Mousaab Bouafia, Djamel Benterki, Adnan Yassine

Optim. Lett., 2018

2017

A feasible primal-dual interior point method for linear semidefinite programming.

Imene Touil, Djamel Benterki, Adnan Yassine

J. Comput. Appl. Math., 2017

A logarithmic barrier approach for linear programming.

Linda Menniche, Djamel Benterki

J. Comput. Appl. Math., 2017

2016

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function.

Mousaab Bouafia, Djamel Benterki, Adnan Yassine

RAIRO Oper. Res., 2016

An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term.

Mousaab Bouafia, Djamel Benterki, Adnan Yassine

J. Optim. Theory Appl., 2016

2015

A relaxed logarithmic barrier method for semidefinite programming.

Kettab Samia, Djamel Benterki

RAIRO Oper. Res., 2015

New effective projection method for variational inequalities problem.

Hassina Grar, Djamel Benterki

RAIRO Oper. Res., 2015

A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function.

Mousaab Bouafia, Djamel Benterki, Adnan Yassine

Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2011

Finding a strict feasible solution of a linear semidefinite program.

Djamel Benterki, Abdelkrim Keraghel

Appl. Math. Comput., 2011

2008

An improving procedure of the interior projective method for linear programming.

Djamel Benterki, A. Leulmi

Appl. Math. Comput., 2008

2007

A numerical feasible interior point method for linear semidefinite programs.

Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi

RAIRO Oper. Res., 2007

2001

A modified algorithm for the strict feasibility problem.

Djamel Benterki, Bachir Merikhi

RAIRO Oper. Res., 2001