Djamel Benterki

From MaRDI portal
Revision as of 13:05, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:306397

Available identifiers

zbMath Open benterki.djamelMaRDI QIDQ306397

List of research outcomes





PublicationDate of PublicationType
An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming2025-01-13Paper
New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems.2024-12-04Paper
An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization2024-08-08Paper
A new full-Newton step feasible interior point method for convex quadratic programming2024-04-25Paper
Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function2024-02-08Paper
https://portal.mardi4nfdi.de/entity/Q61031072023-06-02Paper
An efficient logarithmic barrier method without line search for convex quadratic programming2023-03-29Paper
https://portal.mardi4nfdi.de/entity/Q50297882022-02-14Paper
Adaptive projection methods for linear fractional programming2021-07-27Paper
Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming2021-03-18Paper
A new efficient short-step projective interior point method for linear programming2019-06-11Paper
A penalty approach for a box constrained variational inequality problem2018-10-01Paper
An efficient parameterized logarithmic kernel function for linear optimization2018-07-31Paper
A numerical feasible interior point method for linear semidefinite programs2018-01-12Paper
A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function2017-09-12Paper
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function2017-01-12Paper
A feasible primal-dual interior point method for linear semidefinite programming2016-10-21Paper
A logarithmic barrier approach for linear programming2016-10-21Paper
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term2016-08-31Paper
https://portal.mardi4nfdi.de/entity/Q27942542016-03-17Paper
New effective projection method for variational inequalities problem2015-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53961262014-02-05Paper
Finding a strict feasible solution of a linear semidefinite program2011-03-28Paper
https://portal.mardi4nfdi.de/entity/Q36171442009-03-26Paper
An improving procedure of the interior projective method for linear programming2008-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54537852008-04-03Paper
A modified algorithm for the strict feasibility problem2002-08-18Paper
Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformationN/APaper

Research outcomes over time

This page was built for person: Djamel Benterki