Optimization Online


Convergence Analysis of DC Algorithm for DC programming with subanalytic data

Hoai An Le Thi(lethi***at***univ-metz.fr)
Ngai Huynh Van(ngaivn***at***yahoo.com)
Tao Pham Dinh(pham***at***insa-rouen.fr)

Abstract: 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, we investigate the convergence of DC (difference of convex) algorithm (DCA) for solving DC program with subanalytic data. The convergent rate which depends on the so-called Lojiasiewicz exponent has been established.

Keywords: DC program, DC algorithm, subanalytic, subdifferential, Lojasiewicz exponent

Category 1: Nonlinear Optimization

Category 2: Applications -- OR and Management Sciences (Transportation )


Download: [PDF]

Entry Submitted: 08/15/2013
Entry Accepted: 08/15/2013
Entry Last Modified: 08/15/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society