DC Programming: Overview

R. Horst and N. V. Thoai
Additional contact information
R. Horst: University of Trier
N. V. Thoai: University of Trier

Journal of Optimization Theory and Applications, 1999, vol. 103, issue 1, No 1, 43 pages

Abstract: Abstract Mathematical programming problems dealing with functions, each of which can be represented as a difference of two convex functions, are called DC programming problems. The purpose of this overview is to discuss main theoretical results, some applications, and solution methods for this interesting and important class of programming problems. Some modifications and new results on the optimality conditions and development of algorithms are also presented.

Keywords: DC functions; DC programming; global optimization; nonconvex programming; optimality conditions (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (65)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021765131316 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:103:y:1999:i:1:d:10.1023_a:1021765131316

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021765131316

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().