Di_erence of Convex(D.C.) Functions and Their Minimal Representations
| dc.contributor.advisor | Mitiku, Semu(PhD) | |
| dc.contributor.author | Gidey, Gebretsadik | |
| dc.date.accessioned | 2018-07-16T06:20:17Z | |
| dc.date.accessioned | 2023-11-04T12:32:29Z | |
| dc.date.available | 2018-07-16T06:20:17Z | |
| dc.date.available | 2023-11-04T12:32:29Z | |
| dc.date.issued | 2013-06-27 | |
| dc.description.abstract | A function f de_ned on a given convex set X which can be expressed as a di_erence of two convex (continuous) functions is called d.c function or _-convex function. The functions which are Lipschitz and bounded variation are expressible as a d.c. function and since those family of d.c. functions form a linear space as well as a lattice, it admits many operations. The decomposition of a given function f as a d.c. functions is not unique. Choosing the better (minimal) decomposition is useful in describing the optimality conditions for d.c. optimization | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8585 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Difference of Convex(D.C.) | en_US |
| dc.subject | Functions and Their Minimal | en_US |
| dc.title | Di_erence of Convex(D.C.) Functions and Their Minimal Representations | en_US |
| dc.type | Thesis | en_US |