| dc.contributor.author | Abbasi, Masomeh | en_US |
| dc.date.accessioned | 1399-07-09T07:27:05Z | fa_IR |
| dc.date.accessioned | 2020-09-30T07:27:05Z | |
| dc.date.available | 1399-07-09T07:27:05Z | fa_IR |
| dc.date.available | 2020-09-30T07:27:05Z | |
| dc.date.issued | 2019-12-01 | en_US |
| dc.date.issued | 1398-09-10 | fa_IR |
| dc.date.submitted | 2018-02-22 | en_US |
| dc.date.submitted | 1396-12-03 | fa_IR |
| dc.identifier.citation | Abbasi, Masomeh. (2019). A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations. Iranian Journal of Optimization, 11(2), 107-113. | en_US |
| dc.identifier.issn | 2588-5723 | |
| dc.identifier.issn | 2008-5427 | |
| dc.identifier.uri | http://ijo.iaurasht.ac.ir/article_544914.html | |
| dc.identifier.uri | https://iranjournals.nlai.ir/handle/123456789/322141 | |
| dc.description.abstract | In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the new DAEs methods. Numerical results show the efficiency of the proposed model<strong>.</strong> | en_US |
| dc.format.extent | 794 | |
| dc.format.mimetype | application/pdf | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | Islamic Azad University, Rasht Branch | en_US |
| dc.publisher | دانشگاه آزاد اسلامی واحد رشت | fa_IR |
| dc.relation.ispartof | Iranian Journal of Optimization | en_US |
| dc.relation.ispartof | Iranian Journal of Optimization | fa_IR |
| dc.subject | Differential-algebraic equations | en_US |
| dc.subject | Barrier function method | en_US |
| dc.subject | Interior point method | en_US |
| dc.subject | Convex quadratic programming | en_US |
| dc.subject | Dynamic systems | en_US |
| dc.subject | Stability | en_US |
| dc.subject | Non linear Programming | en_US |
| dc.title | A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations | en_US |
| dc.type | Text | en_US |
| dc.type | Research Paper | en_US |
| dc.contributor.department | Department of Mathematics,Kermanshah Branch, Islamic Azad University, Kermanshah,Iran | en_US |
| dc.citation.volume | 11 | |
| dc.citation.issue | 2 | |
| dc.citation.spage | 107 | |
| dc.citation.epage | 113 | |
