Veuillez utiliser cette adresse pour citer ce document :
http://dspace.univ-bouira.dz:8080/jspui/handle/123456789/16554
Affichage complet
Élément Dublin Core | Valeur | Langue |
---|---|---|
dc.contributor.author | ROUMILI, HAYET | - |
dc.contributor.author | BOUDJELLAL, NAWEL | - |
dc.date.accessioned | 2024-03-28T08:44:13Z | - |
dc.date.available | 2024-03-28T08:44:13Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Université Akli Mohend Oulhadj Bouira | en_US |
dc.identifier.uri | http://dspace.univ-bouira.dz:8080/jspui/handle/123456789/16554 | - |
dc.description.abstract | In this paper, we deal with the study and implementation of an infeasible interior point method for convex quadratic problems (CQP) . The algorithm uses a Newton step and suitable proximity measure for approximately tracing the central path and guarantees that after one feasibility step, the new iterate is feasible and sufficiently close to the central path. For its complexity analysis, we reconsider the analysis used by the authors for linear optimization (LO) and linear complementarity problems (LCP). We show that the algorithm has the best known iteration bound, namely n log (n+1) . Finally, to measure the numerical performance of this algorithm, it was tested on convex quadratic and linear problems. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Université Akli Mohend Oulhadj Bouira | en_US |
dc.subject | Convex quadratic programs | en_US |
dc.subject | Infeasible interior-point method | en_US |
dc.subject | Newton | en_US |
dc.title | AN INFEASIBLE INTERIOR POINT METHOD FOR CONVEX QUADRATIC PROBLEMS | en_US |
dc.type | Article | en_US |
Collection(s) : | Articles |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
AN INFEASIBLE INTERIOR POINT METHOD.pdf | 467,14 kB | Unknown | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.