On the Penalty Method in Optimization; Theory and Numerical Realization.

dc.contributor.advisorR.Deumlich, habiI.(AssociateProfessor)
dc.contributor.authorGidey, Tadesse
dc.date.accessioned2021-12-23T12:43:11Z
dc.date.accessioned2023-11-04T12:31:37Z
dc.date.available2021-12-23T12:43:11Z
dc.date.available2023-11-04T12:31:37Z
dc.date.issued2005-07
dc.description.abstractIn 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.urihttp://etd.aau.edu.et/handle/123456789/29418
dc.language.isoenen_US
dc.publisherAddis Ababa,Universityen_US
dc.subjectOn the Penalty Method In Optimization;en_US
dc.titleOn the Penalty Method in Optimization; Theory and Numerical Realization.en_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Tedesse Gidey.pdf
Size:
18.04 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:

Collections