Tao Pham Dinh In this paper, we introduce an alternative DC algorithm for solving partial DC programs. This proposed algorithm is an natural extension of the standard DC algorithm. Furthermore, we also consider an inexact version of this alternative DC algorithm. The convergence of these proposed algorithms (both the exact and inexact versions) are investigated. The applications to … Read more
DC Programming and DCA have been introduced by Pham Dinh Tao in 1986 and extensively developed by Le Thi Hoai An and Pham Dinh Tao since 1993. These approaches have been successfully applied to solving real life problems in their large scale setting. In this paper, by using the Lojasiewicz inequality for nonsmooth subanalytic functions, … Read more
In this paper, we investigate the use of DC (Difference of Convex functions) models and algorithms in the solution of nonlinear optimization problems by trust-region methods. We consider DC local models for the quadratic model of the objective function used to compute the trust-region step, and apply a primal-dual subgradient method to the solution of … Read more