Transactions of the American Mathematical Society, Vol. 327, No. 2 (Oct., 1991), pp. 795-813 (19 pages) Let Γ(X) denote the proper, lower semicontinuous, convex functions on a Banach space X, equipped ...

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 ...

The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...