On the Penalty Method in Optimization; Theory and Numerical Realization.
dc.contributor.advisor | R.Deumlich, habiI.(AssociateProfessor) | |
dc.contributor.author | Gidey, Tadesse | |
dc.date.accessioned | 2021-12-23T12:43:11Z | |
dc.date.accessioned | 2023-11-04T12:31:37Z | |
dc.date.available | 2021-12-23T12:43:11Z | |
dc.date.available | 2023-11-04T12:31:37Z | |
dc.date.issued | 2005-07 | |
dc.description.abstract | In this thesis, we deal with a theoretical basis of optimization in general and on numerical methods in particular. Here the penalty methods are in the foreground . Some generalizations for theorems into arbitrary metric space with mild assumptions (Theorem 2.1.3 and 3.1.3) are done. In addition, a numerical computation is presented and tested, with the code written in Mathematica 4.1 . Comparisons are made for different choice of the penalty function with respect to convergence speed and objective value. | en_US |
dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/29418 | |
dc.language.iso | en | en_US |
dc.publisher | Addis Ababa,University | en_US |
dc.subject | On the Penalty Method In Optimization; | en_US |
dc.title | On the Penalty Method in Optimization; Theory and Numerical Realization. | en_US |
dc.type | Thesis | en_US |