An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
Billel Zaoui, Djamel Benterki & Adnan Yassine
Journal of Applied Mathematics and Computing, 70 (2024), pp 2129–2148
New Efficient Descent Direction of a Primal-dual Path-following Algorithm for Linear Programming
Billel Zaoui, Djamel Benterki & Samia Khelladi
STATISTICS, OPTIMIZATION AND INFORMATION COMPUTING Stat., Optim. Inf. Comput, 12 (2024), pp 1098–1112
On Isaac’sWar Game of Attrition and Attack Using Dynamic Programming Approach
Benghebrid Safa , Bouremani Touffik and Benterki Djamel
Games , 15 (2024), pp 35
New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems
Youcef Elhamam Hemici, Samia Khelladi and Djamel Benterki
KYBERNETIKA, 60 (2024), pp 535–552
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
Billel Zaoui, Djamel Benterki, Samia Khelladi
Operations Research Letters, 57 (2024), pp 107192
A new full-Newton step feasible interior point method for convex quadratic programming
Nawel Boudjellal, & Djamel Benterki
Optimization, 73 (2024), pp 1571–1588
A penalty method for linear programming
Linda Menniche, Djamel Benterki and Bachir Merikhi
Journal of Information & Optimization Sciences, 45 (2024), pp 677–685
Efficient one-parameter family of conjugate gradient methods
Samia Khelladi, Djamel Benterki
Journal of Information & Optimization Sciences, 45 (2024), pp 699–715
Interior-point algorithm for linear programming based on a new descent direction
Billel Zaoui, Djamel Benterki, Kraria Aicha and Raouache Hadjer
RAIRO-Oper. Res., 57 (2023), pp 2473 – 2491
An efficient parameterized logarithmic kernel function for semidefinite optimization
Zerari Amina, Benterki Djamel and Yassine Adnan
Pacific Journal of Optimization, 19 (2023), pp 1—20
A New Hybrid Genetic with Firefly Algorithm for Solving Cyber-Criminal's Attacks
Narimen Hafsi, Hanaa Hachimi and Djamel Benterki
2022 8th International Conference on Optimization and Applications (ICOA), Genoa, Italy, , 0 (2022), pp 1-5
Hybrid conjugate gradient-BFGS methods based on Wolfe line search,
Khelladi Samia, Benterki Djamel
Stud. Univ. Babes-Bolyai Math. , 67 (2022), pp 855–869
Optimal Control of an Epidemic by Vaccination using Dynamic Programming Approach
Bouremani Touffik, Benterki Djamel & Slimani Yacine
Int. J. Mathematics in Operational Research, 23 (2022), pp 372--393
Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation
Ahlem Bennani, Djamel Benterki
International Journal of Computing Science and Mathematics, 16 (2022), pp 35-45
Numerical study of recent interior point approaches for linear programming
Billel Zaoui, Djamel Benterki & Samia Khelladi
Euro-Tbilisi Mathematical Journal, 10 (2022), pp 53—63
Complexity Analysis of Interior Point Methods for Convex Quadratic Programming Based on a Parameterized Kernel Function
Nawel Boudjellal, Hayet Roumili & Djamel Benterki
Bol. Soc. Paran. Mat, 40 (2022), pp 1–16
An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming
Soraya Chaghoub and Djamel Benterki
Numerical Analysis and Applications, 15 (2022), pp 156–169
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, Optimization
Nawel Boudjellal, Hayet Roumili & Djamel Benterki
Taylor & Francis , 70 (2021), pp 1703—1724
An efficient logarithmic barrier method for linear programming
Linda Menniche, Djamel Benterki & Imene Benchetta
Journal of Information & Optimization Sciences, Taylor & Francis, 42 (2021), pp 1799—1813
Generalized solution of a nonlinear optimal control of the heel angle of a rocket
Bouremani Touffik, Benterki Djamel,
New Trends in Mathematical Sciences, NTMSCI 9, 1 (2021), pp 79—83
A Logarithmic Barrier Method Based On a New Majorant Function for Convex Quadratic Programming
Soraya Chaghoub and Djamel Benterki
IAENG International Journal of Applied Mathematics,, 51 (2021), pp 63-568
adaptive projection methods for linear fractional programming
Bennani Ahlem, Benterki Djamel & Grar Hassina
RAIRO-Oper. Res, 55 (2021), pp S2383 - S2392
Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
Benterki Djamel, Yassine Adnan & Zerari Amina
Bull. Math. Soc. Sci. Math. Roumanie , 64 (2021), pp 3--15
Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
Chaghoub Soraya, Benterki Djamel
J. Numer. Anal. Approx. Theory, 49 (2020), pp 15–21
A primal-dual interior-point method for the semidefinite programming problem based on a new kernel function
Touil Imene, Benterki Djamel
Journal of nonlinear functional analysis, 25 (2019), pp 1—17
A new efficient primal-dual projective interior point method for semidefinite programming
Zerari Amina, Benterki Djamel
Journal of nonlinear functional analysis, , 12 (2019), pp 1-12
A penalty approach for a box constrained variational inequality problem
Kebaili Zahira, Benterki Djamel
Applications of Mathematics Springer, 63 (2018), pp 439–454
Study of a logarithmic approach for linear semidefinite programming
A. Leulmi, B. Merikhi and Dj. Benterki
Journal of Siberian Federal University. Mathematics & Physics , 11 (2018), pp 300–312
An efficient parameterized logarithmic kernel function for linear optimization
Bouafia Mousaab, Benterki Djamel & Yassine Adnan
Optim Lett, 12 (2018), pp 1079–1097
A new efficient short-step projective interior point method for linear programming
Bouafia Mousaab, Benterki Djamel & Yassine Adnan
Operations Research Letters , 46 (2018), pp 291–294
A Logarithmic Barrier approach for Linear Programming
Linda Menniche, Djamel Benterki
Journal of Computational and Applied Mathematics, Elsevier, 312 (2017), pp 267–275
A feasible primal-dual interior point method for linear semidefinite programming
Imene Touil, Djamel Benterki & Adnan Yassine
Journal of Computational and Applied Mathematics, Elsevier, 312 (2017), pp 216–230
An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term
Bouafia Moussab, Benterki Djamel, Yassine Adnan
Journal of Optimization Theory and Applications, 170 (2016), pp 528–545
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function,
Bouafia Moussab, Benterki Djamel, Yassine Adnan
RAIRO-Oper. Res. , 50 (2016), pp 935-949
A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function,
Bouafia Moussab, Benterki Djamel, Yassine Adnan
Modelling, Computation and Optimization in Information Systems and Management Sciences, Advances in Intelligent Systems and Computing, 359 (2015), pp 357-368
A numerical implementation of a predictor-corrector algorithm for sufficient linear complementarity problem
Benterki Djamel, Bouloudenine Nadjiba
Advances in Mathematics and Statistical Sciences, 1 (2015), pp 387—392
New effective projection method for variational inequalities problem
Grar Hassina, Benterki Djamel
RAIRO-Oper. Res., 49 (2015), pp 805–820
A relaxed logarithmic barrier method for semidefinite programming
Kettab Samia & Benterki Djamel
Rairo –Operation Research, 49 (2015), pp 555—568
Improving complexity of Karmarkar’s approach for linear programming
Djamel Benterki & Mousaab Bouafia
Revue d’analyse numérique et de théorie de l’approximation , 43 (2014), pp 149–157
Extension of Karmarkar’s Algorithm for Solving an Optimization Problem
E. Djeffal, L. Djeffal and D. Benterki
G.A. Anastassiou and O. Duman (eds.), Advances in Applied Mathematics and Approximation Theory, Springer Proceedings in Mathematics & Statistics, 41 (2013), pp 263-271
A weighted path-following method for linearly constrained convex
Z. Kebbiche & D. Benterki
Revue Roumaine de Mathématiques Pures et Appliquées, 57 (2012), pp 245-256
Finding a strict feasible solution of a linear semidefinite program
D. Benterki, & A. Keraghel
Applied Mathematics and Computation, Elsevier , 217 (2011), pp 6437—6440
An improving procedure on the interior projective method for linear programming
D. Benterki, & A. Leulmi
Applied Mathematics and Computation, Elsevier , 199 (2008), pp 811—819
Application des méthodes d’optimisation pour la résolution du problème d’inégalité variationnelles
S. Radjeai, A. Keraghel & D. Benterki
Revue d'Analyse Numerique et de Theorie de l'Approximation (ANTA), 36 (2007), pp 97—106
Elaboration and implantation of an algorithm solving a capacitated Four-Index transportation problem.
R. Zitouni, A. Keraghel & D. Benterki
Applied Mathematical sciences, 1 (2007), pp 2643—2657
A numerical feasible interior point method for linear semidefinite programs
D. Benterki, J. P. Crouzeix, B. Merikhi
Rairo –Operation Research, 41 (2007), pp 49—59
A feasible primal algorithm for linear semidefinite programming
D. Benterki, J. P. Crouzeix, B. Merikhi
Modelling, Computation and optimization in Information Systems and Management Sciences, Hermes Science Publishing, 1 (2004), pp 114—120
A numerical implementation of an interior point method for semidefinite programming
D. Benterki, J.P. Crouzeix, B. Merikhi,
Pesquisa Operacional, 23 (2003), pp 49--59
M. Kolli & D. Benterki, Approximation d’un problème aux limites non linéaire dans un intervalle infini exacte et méthode approchée
M. Kolli & D. Benterki
Maghreb Mathematical Review, 10 (2001), pp 256—268
A modified Algorithm for the strict feasibility
D. Benterki & B. Merikhi
Rairo –Operation Research, 35 (2001), pp 395—400
Sur les performances de l’algorithme de Karmarkar pour la Programmation linéaire
A. Keraghel & D. Benterki,
revue Roumainne des sciences techniques mécaniques appliquée, 46 (2001), pp 87—96