Di_erence of Convex(D.C.) Functions and Their Minimal Representations

No Thumbnail Available

Date

2013-06-27

Journal Title

Journal ISSN

Volume Title

Publisher

Addis Ababa University

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

Description

Keywords

Difference of Convex(D.C.), Functions and Their Minimal

Citation

Collections