| Titre : | Logarithmic Barrier Interior Point Method for Linearly Constrained Convex Programming |
| Auteurs : | Selma Lamri, Auteur ; Bachir Merikhi, Directeur de thèse |
| Type de document : | texte imprimé |
| Editeur : | Sétif : Université ferhat Abbas faculté des Sciences département des Mathématique, 2022 |
| ISBN/ISSN/EAN : | TS4/9125 |
| Format : | 1.Vol.(065 f.) / 30 cm |
| Langues: | Anglais |
| Catégories : | |
| Mots-clés: | Linearly constrained convex programming ; Quadratic programming ; A primal-dual interior-point method ; Logarithmic barrier methods ; A Majorant functions. |
| Résumé : |
In this thesis,we are interested solving the linearly constrained convex optimization problem. In the first part,we present a weighted logarithmic barrier method followed by a study of convergence,the efficiency of the proposed method is shown by presenting numerical experiments. In the second part,we propose a primal-dual method to solving convex quadratic programming,the technique of majorant function is used to compute the step size,this work is enriched by important numerical simulations. |
| Côte titre : | TS4/9125 = E-TH/2008 |
Exemplaires (1)
| Cote | Support | Localisation | Disponibilité |
|---|---|---|---|
| TS4/9125 | Thèse | Bibliothèque centrale | Disponible |
Accueil
