The following pages link to Djamel Benterki (Q306397):
Displaying 27 items.
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- A feasible primal-dual interior point method for linear semidefinite programming (Q329782) (← links)
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Finding a strict feasible solution of a linear semidefinite program (Q632881) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- (Q928102) (redirect page) (← links)
- An improving procedure of the interior projective method for linear programming (Q928104) (← links)
- A penalty approach for a box constrained variational inequality problem (Q1785662) (← links)
- A new efficient short-step projective interior point method for linear programming (Q2417152) (← links)
- (Q2794254) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- New effective projection method for variational inequalities problem (Q3194702) (← links)
- (Q3617144) (← links)
- A modified algorithm for the strict feasibility problem (Q4546062) (← links)
- A numerical feasible interior point method for linear semidefinite programs (Q4600612) (← links)
- Adaptive projection methods for linear fractional programming (Q5002367) (← links)
- (Q5029788) (← links)
- A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
- (Q5396126) (← links)
- (Q5453785) (← links)
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming (Q5853250) (← links)
- An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851) (← links)
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573) (← links)
- Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation (Q6526521) (← links)
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization (Q6584764) (← links)
- New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems. (Q6648151) (← links)
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)
