Optimization with D.C. Data. (Difference of Convex Functions or Sets)
| dc.contributor.advisor | Mitiku, Semu (PhD) | |
| dc.contributor.author | Geremew, Alemayehu | |
| dc.date.accessioned | 2022-03-28T09:24:32Z | |
| dc.date.accessioned | 2023-11-09T14:29:30Z | |
| dc.date.available | 2022-03-28T09:24:32Z | |
| dc.date.available | 2023-11-09T14:29:30Z | |
| dc.date.issued | 2014-06 | |
| dc.description.abstract | This semmar paper reviews the theory, methods and algorithm for so lving d.c optimization, as has been developed in recent years. In chapter one ofthis paper some fundamental concepts and definitions are discussed. Chapter two focuses on the motivation, basic classification of global optimization, some typical examples of d.c.programming problems that are encountered in various fie lds and properties of d.c.functions and d.c.sets. Chapter three is devoted to the concept of duality in the d.c optimization and chapter four discusses global and local optimality criteria and also so lution methods for d.c optimization. Finally I would like to express my heart felt thanks to my adviser Dr. Semu Mitiku for his valuable comments and suggestions during the preparation of this graduate report. I am also grateful to my sister Frehiwot Geremew who is always willing to take care of me. I sincerely express my gratitude to all those who have helped me in this endeavor. | en_US |
| dc.identifier.uri | http://10.90.10.223:4000/handle/123456789/30935 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.title | Optimization with D.C. Data. (Difference of Convex Functions or Sets) | en_US |
| dc.type | Thesis | en_US |