Djamel Benterki

According to our database1, Djamel Benterki authored at least 12 papers between 2001 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A new efficient short-step projective interior point method for linear programming.
Oper. Res. Lett., 2018

An efficient parameterized logarithmic kernel function for linear optimization.
Optim. Lett., 2018

2017
A feasible primal-dual interior point method for linear semidefinite programming.
J. Comput. Appl. Math., 2017

A logarithmic barrier approach for linear programming.
J. Comput. Appl. Math., 2017

2016
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function.
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.
J. Optim. Theory Appl., 2016

2015
A relaxed logarithmic barrier method for semidefinite programming.
RAIRO Oper. Res., 2015

New effective projection method for variational inequalities problem.
RAIRO Oper. Res., 2015

A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function.
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.
Appl. Math. Comput., 2011

2007
A numerical feasible interior point method for linear semidefinite programs.
RAIRO Oper. Res., 2007

2001
A modified algorithm for the strict feasibility problem.
RAIRO Oper. Res., 2001


  Loading...