BENTERKI Djamel
Grade: Professeur
Email: djbenterki@univ-setif.dz
Département: Mathématiques
Nom : BENTERKI
Prénom : Djamel
Fonction : Enseignant chercheur
Grade : Professeur
Email : djbenterki@univ-setif.dz

    Journaux (26)

  • 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