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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of numerical analysis and approximation theory Jg. 53; H. 2; S. 199 - 217
Hauptverfasser:	Bendaas, Yasmina, Achache, Mohamed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Publishing House of the Romanian Academy 18.12.2024
Schlagworte:	Convex quadratic semidefinite optimization, Interior-point methods, Primal-dual algorithm, Newton method
ISSN:	2457-6794, 2501-059X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!