Derivative Free Optimization
| dc.contributor.advisor | Mitk, Semu (PhD) | |
| dc.contributor.author | Abraha, Teklebirhan | |
| dc.date.accessioned | 2018-07-18T08:06:12Z | |
| dc.date.accessioned | 2023-11-04T12:30:42Z | |
| dc.date.available | 2018-07-18T08:06:12Z | |
| dc.date.available | 2023-11-04T12:30:42Z | |
| dc.date.issued | 2011-01 | |
| dc.description.abstract | We will present derivative free algorithms which optimize non-linear unconstrained optimization problems of the following kind: minxEnRmff (ff:R nn→R The algorithms developed for this type of problems are categorized as one-dimensional search (golden section and Fibonacci) methods and multidimensional search methods (Powell’s method and trust region). These algorithms will, hopefully, find the value of for which ff is the lowest. The dimension n of the search space must be lower than some number (say 100). We do NOT have to know the derivatives of We must only have a code which evaluates ff(xx) for a given value ofxx. Each component of the vector must be a continuous real parameter of ff(xx). | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9206 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Derivative Free Optimization | en_US |
| dc.title | Derivative Free Optimization | en_US |
| dc.type | Thesis | en_US |