default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDjamel Benterki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Zaoui Billel, Djamel Benterki, Adnan Yassine:
An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization. J. Appl. Math. Comput. 70(3): 2129-2148 (2024)- [j17]Zaoui Billel, Djamel Benterki, Samia Khelladi:
Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization. Oper. Res. Lett. 57: 107192 (2024) - [i1]Aicha Kraria, Bachir Merikhi, Djamel Benterki:
Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation. CoRR abs/2403.11684 (2024) - 2023
- [j16]Zaoui Billel, Djamel Benterki, Aicha Kraria, Raouache Hadjer:
Interior-point algorithm for linear programming based on a new descent direction. RAIRO Oper. Res. 57(5): 2473-2491 (2023) - 2022
- [j15]Ahlem Bennani, Djamel Benterki:
Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation. Int. J. Comput. Sci. Math. 16(1): 35-45 (2022) - [j14]Touffik Bouremani
, Djamel Benterki, Yacine Slimani:
Optimal control of an epidemic by vaccination using dynamic programming approach. Int. J. Math. Oper. Res. 23(3): 372-393 (2022) - 2021
- [j13]Ahlem Bennani, Djamel Benterki, Hassina Grar:
Adaptive projection methods for linear fractional programming. RAIRO Oper. Res. 55(Supplement): S2383-S2392 (2021)
2010 – 2019
- 2018
- [j12]Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
An efficient parameterized logarithmic kernel function for linear optimization. Optim. Lett. 12(5): 1079-1097 (2018) - [j11]Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
A new efficient short-step projective interior point method for linear programming. Oper. Res. Lett. 46(3): 291-294 (2018) - 2017
- [j10]Imene Touil, Djamel Benterki, Adnan Yassine:
A feasible primal-dual interior point method for linear semidefinite programming. J. Comput. Appl. Math. 312: 216-230 (2017) - [j9]Linda Menniche, Djamel Benterki:
A logarithmic barrier approach for linear programming. J. Comput. Appl. Math. 312: 267-275 (2017) - 2016
- [j8]Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
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. 170(2): 528-545 (2016) - [j7]Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function. RAIRO Oper. Res. 50(4-5): 935-949 (2016) - 2015
- [j6]Kettab Samia, Djamel Benterki:
A relaxed logarithmic barrier method for semidefinite programming. RAIRO Oper. Res. 49(3): 555-568 (2015) - [j5]Hassina Grar, Djamel Benterki:
New effective projection method for variational inequalities problem. RAIRO Oper. Res. 49(4): 805-820 (2015) - [c1]Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function. MCO (1) 2015: 357-368 - 2011
- [j4]Djamel Benterki, Abdelkrim Keraghel:
Finding a strict feasible solution of a linear semidefinite program. Appl. Math. Comput. 217(13): 6437-6440 (2011)
2000 – 2009
- 2008
- [j3]Djamel Benterki, A. Leulmi:
An improving procedure of the interior projective method for linear programming. Appl. Math. Comput. 199(2): 811-819 (2008) - 2007
- [j2]Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi:
A numerical feasible interior point method for linear semidefinite programs. RAIRO Oper. Res. 41(1): 49-59 (2007) - 2001
- [j1]Djamel Benterki, Bachir Merikhi:
A modified algorithm for the strict feasibility problem. RAIRO Oper. Res. 35(4): 395-399 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
