Abebe, Setargie (2016) Convex Quadratic Programming. Masters thesis, Addis Ababa University.
![[img]](http://thesisbank.jhia.ac.ke/style/images/fileicons/application_pdf.png) |
PDF (Convex Quadratic Programming)
Abebe, Setargie.pdf - Accepted Version Restricted to Repository staff only Download (479kB) | Request a copy |
Abstract
Quadratic programming is one of the types of . There is no single method available for solving quadratic programming problem. So a number of methods have been developed for solving quadratic programming problems. In this paper we consider and method, method and . Method and penalty method are very important methods to solve equality, inequality and mixed constraint quadratic programming problems.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Africana |
| Depositing User: | Selom Ghislain |
| Date Deposited: | 25 Jun 2018 10:38 |
| Last Modified: | 25 Jun 2018 10:38 |
| URI: | http://thesisbank.jhia.ac.ke/id/eprint/4251 |
Actions (login required)
 |
View Item |