Title: Duality For D.C. Optimization Over Compact Sets
Abstract: Convex duality theory has been successfully used for different optimization problems dealing with differences of convex functions (see for instance [10, 8, 3, 12, 11, 4] and references therein). This paper contains an alternative approach to the duality theory for d.c. programming problems developed in [6]. That theory associates to the general problem of minimizing a d.c. function under several d.c. constraints on an arbitrary locally convex space a dual problem defined in terms of conjugate functions, in such a way that, under suitable constraint qualifications, a strong duality theorem holds. These constraint qualifications are satisfied in specific situations considered in [6]. However they are in general difficult to verify.
Publication Year: 2001
Publication Date: 2001-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot