Difference of Convex (D.C.) Functions and their Minimal Representations

Gidey, Gebretsadik (2013) Difference of Convex (D.C.) Functions and their Minimal Representations. Masters thesis, Addis Ababa University.

[img] PDF (Difference of Convex (D.C.) Functions and their Minimal Representations)
Gebretsadik, Gidey.pdf - Accepted Version
Restricted to Repository staff only

Download (635kB) | Request a copy


A function f defined on a given convex set X which can be expressed as a difference 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.

Item Type: Thesis (Masters)
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Divisions: Africana
Depositing User: Selom Ghislain
Date Deposited: 13 Jul 2018 12:25
Last Modified: 13 Jul 2018 12:25
URI: http://thesisbank.jhia.ac.ke/id/eprint/7374

Actions (login required)

View Item View Item