Open Access
Research Article·pp. 99–117·Vol. 47, Issue 1Jan 2026
Efficient descent direction of a primal-dual interior point algorithm for convex quadratic optimization
Billel Zaoui, Dj. Benterki, Samia Khelladi
Published Online: 01 Jan 2026DOI: 10.47974/JIOS-1463
In this paper: We introduce a new interior-point method for solving convex quadratic programming under full-Newton step. The method involves an equivalent algebraic transformation applied to the system defining the...
