A New Kernel Function And Iteration Bounds For Convex Quadratic Programming / Aya Djeziri

Public ISBD Titre : A New Kernel Function And Iteration Bounds For Convex Quadratic Programming Type de document : document électronique Auteurs : Aya Djeziri, Auteur ; Chafia Daili, Directeur de thèse Editeur : Sétif:UFS Année de publication : 2026 Importance : 1 vol (52 f.) Format : 29 cm Note générale : Langues : Anglais (eng) Catégories : Mathématique Mots-clés : Convex Quadratic Programming, Primal-Dual Interior Point Methods, Kernel Function, Central Path, Polynomial Complexity, Newton's Method Résumé : This thesis focuses on the study and development of primal-dual interior-point methods (IPMs) applied to convex quadratic programming (CQP) problems. The objective of this work is to integrate and analyze a new kernel function to efficiently solve convex quadratic programs. We present a detailed algorithmic study then establish the theoretical polynomial complexity for large-step methods, which turns out to be identical to that of small-step methods (namely O(√n log( ????/????))), Finally, to evaluate the performance of our algorithm, numerical tests and a comparative study have been carried out on a varied series of examples. Côte titre : MAM/0880 A New Kernel Function And Iteration Bounds For Convex Quadratic Programming [document électronique] / Aya Djeziri, Auteur ; Chafia Daili, Directeur de thèse . - [S.l.] : Sétif:UFS, 2026 . - 1 vol (52 f.) ; 29 cm. Langues : Anglais (eng) Catégories : Mathématique Mots-clés : Convex Quadratic Programming, Primal-Dual Interior Point Methods, Kernel Function, Central Path, Polynomial Complexity, Newton's Method Résumé : This thesis focuses on the study and development of primal-dual interior-point methods (IPMs) applied to convex quadratic programming (CQP) problems. The objective of this work is to integrate and analyze a new kernel function to efficiently solve convex quadratic programs. We present a detailed algorithmic study then establish the theoretical polynomial complexity for large-step methods, which turns out to be identical to that of small-step methods (namely O(√n log( ????/????))), Finally, to evaluate the performance of our algorithm, numerical tests and a comparative study have been carried out on a varied series of examples. Côte titre : MAM/0880

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
MAM/0880	MAM/0880	Mémoire	Bibliothèque des sciences	Anglais	Disponible Disponible

---

1 (1 - 1 / 1)