A general double-proximal gradient algorithm for d . c . programming

Abstract

The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics