Please use this identifier to cite or link to this item:
http://dspace.univ-bouira.dz:8080/jspui/handle/123456789/16554
Title: | AN INFEASIBLE INTERIOR POINT METHOD FOR CONVEX QUADRATIC PROBLEMS |
Authors: | ROUMILI, HAYET BOUDJELLAL, NAWEL |
Keywords: | Convex quadratic programs Infeasible interior-point method Newton |
Issue Date: | 2018 |
Publisher: | Université Akli Mohend Oulhadj Bouira |
Citation: | Université Akli Mohend Oulhadj Bouira |
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. |
URI: | http://dspace.univ-bouira.dz:8080/jspui/handle/123456789/16554 |
Appears in Collections: | Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AN INFEASIBLE INTERIOR POINT METHOD.pdf | 467,14 kB | Unknown | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.