A numerical study of an infeasible interior-point algorithm for convex quadratic semi-definite optimization

The focus of this research is to apply primal-dual interior-point pathfollowing methods, specifically those derived from Newton’s method for solving convex quadratic semidefinite optimization (CQSDO) problems. In this paper, we present a numerical study of an infeasible primal-dual interior-point me...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of numerical analysis and approximation theory Vol. 53; no. 2; pp. 199 - 217
Main Authors:	Bendaas, Yasmina, Achache, Mohamed
Format:	Journal Article
Language:	English
Published:	Publishing House of the Romanian Academy 18.12.2024
Subjects:	Convex quadratic semidefinite optimization, Interior-point methods, Primal-dual algorithm, Newton method
ISSN:	2457-6794, 2501-059X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!