The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate ...

Mathematics of Operations Research, Vol. 20, No. 4 (Nov., 1995), pp. 818-837 (20 pages) A nonlinear extension of Farkas' lemma for systems involving the difference of sublinear functions is presented.