Abstract
We introduce a duality scheme for the problem of minimizing the difference of two extended real-valued convex functions (d.c. functions) under finitely many d.c. constraints in terms of the Legendre-Fenchel conjugates of the involved convex functions. © 1999 Academic Press.
Cite
CITATION STYLE
APA
Martínez-Legaz, J. E., & Volle, M. (1999). Duality in D.C. Programming: The Case of Several D.C. Constraints. Journal of Mathematical Analysis and Applications, 237(2), 657–671. https://doi.org/10.1006/jmaa.1999.6496
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free