DC programming: Overview

Citation
R. Horst et Nv. Thoai, DC programming: Overview, J OPTIM TH, 103(1), 1999, pp. 1-43
Citations number
61
Categorie Soggetti
Engineering Mathematics
Journal title
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
ISSN journal
00223239 → ACNP
Volume
103
Issue
1
Year of publication
1999
Pages
1 - 43
Database
ISI
SICI code
0022-3239(199910)103:1<1:DPO>2.0.ZU;2-P
Abstract
Mathematical programming problems dealing with functions, each of which can be represented as a difference of two convex functions, are called DC prog ramming problems. The purpose of this overview is to discuss main theoretic al results, some applications, and solution methods for this interesting an d important class of programming problems. Some modifications and new resul ts on the optimality conditions and development of algorithms are also pres ented.