Abstract
In the preceding chapters we have considered optimization problems with various primal constraint sets and objective functions. In this chapter we shall focus on “d.c. optimization problems,” i.e., optimization problems involving differences of convex functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2006). Duality for D.C. Optimization Problems. In: Duality for Nonconvex Approximation and Optimization. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-28395-1_8
Download citation
DOI: https://doi.org/10.1007/0-387-28395-1_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-28394-4
Online ISBN: 978-0-387-28395-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)