الرئيسية › دليل الباحثين › Djamel Benterki
Djamel Benterki
الانتماء : University of Jijel · University Ferhat Abbas of Setif
- 47منشورات (انتماء جزائري)
- 58مجموع المنشورات
- 197الاستشهادات
- 7مؤشر h
الملف البحثي
لدى Djamel Benterki 47 منشور(ات) مفهرسة (2001–2026). تُنشر أعماله أساسًا في «RAIRO - Operations Research»، «Journal of Information and Optimization Sciences» و«Journal of Computational and Applied Mathematics». أكثر مقالاته استشهادًا هو «An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier T» (2016)، وقد استُشهد به 39 مرة. 16 من هذه المنشورات تعود إلى آخر ثلاث سنوات من النشاط. شارك في تأليف أعماله 12 باحثًا على الأقل، منهم باحثون من مؤسسات في فرنسا.
هل هذا أنت؟ عرّف بأبحاثك
أنشئ ملفك على DzCademia مجانًا وأضف مقالاتك: ستظهر بسهولة أكبر على Google وفي مساعدي الذكاء الاصطناعي مثل ChatGPT، فيقرؤها ويستشهد بها عدد أكبر من الناس.
إنشاء ملفي المجاني إضافة منشوراتيمجالات البحث
- Advanced Optimization Algorithms Research
- Matrix Theory and Algorithms
- Optimization and Variational Analysis
- Complexity and Algorithms in Graphs
- Advanced Control Systems Optimization
المنشورات (47)
- Efficient descent direction of a primal-dual interior point algorithm for convex quadratic optimization
- Solving a quadratic fractional problem via a new quadratic formulation
- An improved descent direction for path-following algorithm in monotone linear complementarity problems
- An improved search direction based on algebraic equivalent transformation technique for convex quadratic optimization
- An efficient hybrid three-term conjugate gradient method with practical applications
- On non-standard Isaac’s wall pursuit game using dynamic programming method
- Genetic-Firefly Algorithm Based Approach in Image Steganography
- New parameter of conjugate gradient method for unconstrained nonlinear optimization
- Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
- On the solution of Dolichobrachistochrone differential game via dynamic programming approach
- An Efficient Hyperbolic Kernel Function Yielding the Best Known Iteration Bounds for Linear Programming
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- A penalty method for linear programming
- Efficient one-parameter family of conjugate gradient methods
- New efficient descent direction of a primal-dual path-following algorithm for linear programming
- On Isaac’s War Game of Attrition and Attack Using Dynamic Programming Approach
- A new full-Newton step feasible interior point method for convex quadratic programming
- Interior-point algorithm for linear programming based on a new descent direction
- An efficient parameterized logarithmic kernel function for semidefinite optimization.
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
- A New Hybrid Genetic with Firefly Algorithm for Solving Cyber-Criminal's Attacks
- Optimal control of an epidemic by vaccination using dynamic programming approach
- An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming
- An efficient logarithmic barrier method for linear programming
- Generalized solution of a nonlinear optimal control of the heel angle of a rocket
- Interior-point algorithm for semidefinite programming based on a logarithmic kernel function.
- Adaptive projection methods for linear fractional programming
- A logarithmic barrier method for linear programming based on a new minorant function
- Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
- A new efficient short-step projective interior point method for linear programming
- A penalty approach for a box constrained variational inequality problem
- An efficient parameterized logarithmic kernel function for linear optimization
- An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term
- A feasible primal–dual interior point method for linear semidefinite programming
- A logarithmic barrier approach for linear programming
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- A relaxed logarithmic barrier method for semidefinite programming
- New effective projection method for variational inequalities problem
- A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function
- Improving complexity of Karmarkar's approach for linear programming
- Extension of Karmarkar’s Algorithm for Solving an Optimization Problem
- Finding a strict feasible solution of a linear semidefinite program
- A numerical feasible interior point method for linear semidefinite programs
- An improving procedure of the interior projective method for linear programming
- Application des méthodes d'optimisation pour la résolution du problème d'inégalités variationnelles
- A numerical implementation of an interior point method for semidefinite programming
- A modified algorithm for the strict feasibility problem
مجلات النشر
- RAIRO - Operations Research × 7
- Journal of Information and Optimization Sciences × 5
- Journal of Computational and Applied Mathematics × 4
- Journal of Numerical Analysis and Approximation Theory × 3
- DOAJ (DOAJ: Directory of Open Access Journals) × 2
- International Conference on Optimization and Applications (ICOA) × 2
المنشورات حسب السنة
- 20266
- 20252
- 20248
- 20233
- 20224
- 20213
- 20203
- 20182
- 20171
- 20163
التعاون العلمي
المؤسسات الشريكة : University of Guelma · Centre National de la Recherche Scientifique · Laboratoire de Mathématiques Appliquées du Havre · University of Batna 1 · University of Bouira
بلدان المؤلفين المشاركين : فرنسا
المؤلفون المشاركون
- Samia Khelladi
- Billel Zaoui
- Mousaab Bouafia
- Touffik Bouremani
- Linda Menniche
- Bachir Merikhi
- Amina Zerari
- Abdelkrim Keraghel
- Aicha Kraria
- Hassina Grar
- Yacine Slimani
- Imene Benchetta
البيانات البيبليوغرافية مصدرها OpenAlex (قاعدة مفتوحة).
لماذا تختارون DzCademia؟
ملفات أكاديمية ومقالات ومداخلات علمية: امنحوا أبحاثكم حضوراً عاماً منظماً. تساعد البيانات الوصفية المدمجة محركات البحث ومساعدات الذكاء الاصطناعي على التعرف على أعمالكم وفهم مراجعها.
علّق عبر Google
سجّل الدخول عبر Google للتعليق مباشرة على هذه الصفحة.