New algorithms based on the interior point method for convex quadratic programming

dc.contributor.authorTahmasebzadeh, S.
dc.contributor.authorNavidi, H.
dc.contributor.authorMalek, A.
dc.date.accessioned2024-07-12T20:56:11Z
dc.date.available2024-07-12T20:56:11Z
dc.date.issued2009en_US
dc.departmentMaltepe Üniversitesi, İnsan ve Toplum Bilimleri Fakültesien_US
dc.description.abstractThis paper presents three new algorithms for solving convex quadratic programming problems subject to the linear constraints. These algorithms are based on the general theory of Karmarkar interior points techniques. The first one uses the Karmarkar idea and linearization of the objective function. The second and third algorithms are modification of the first algorithm using the Schrijver and Malek-Naseri approaches respectively. These three new schemes are tested against the algorithm of Kebbiche-Keraghel-Yassine (KKY). It is shown that these three new algorithms are more efficient and converge to the correct optimal solution, while the KKY algorithm does not converge in some cases. Numerical results are given to illustrate the performance of the new algorithms.en_US
dc.identifier.citationTahmasebzadeh, S., Navidi, H. ve Malek, A. (2009). New algorithms based on the interior point method for convex quadratic programming. Maltepe Üniversitesi. s. 356.en_US
dc.identifier.endpage357en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage356en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2940
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07664
dc.titleNew algorithms based on the interior point method for convex quadratic programmingen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar