Duality in D.C. Programming: The Case of Several D.C. Constraints

Juan Enrique Martínez-Legaz; Michel Volle

doi:https://doi.org/10.1006/jmaa.1999.6496

Duality in D.C. Programming: The Case of Several D.C. Constraints

Juan Enrique Martínez-Legaz, Michel Volle

Department of Economics and Economic History

Research output: Contribution to journal › Article › Research › peer-review

58 Citations (Scopus)

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.

Original language	English
Pages (from-to)	657-671
Journal	Journal of Mathematical Analysis and Applications
Volume	237
DOIs	https://doi.org/10.1006/jmaa.1999.6496
Publication status	Published - 15 Sep 1999

Access to Document

https://doi.org/10.1006/jmaa.1999.6496

Cite this

@article{f444d9a489404fbba19f8314f19ad19d,

title = "Duality in D.C. Programming: The Case of Several D.C. Constraints",

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. {\textcopyright} 1999 Academic Press.",

author = "Mart{\'i}nez-Legaz, {Juan Enrique} and Michel Volle",

year = "1999",

month = sep,

day = "15",

doi = "https://doi.org/10.1006/jmaa.1999.6496",

language = "English",

volume = "237",

pages = "657--671",

journal = "Journal of Mathematical Analysis and Applications",

issn = "0022-247X",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Duality in D.C. Programming: The Case of Several D.C. Constraints

AU - Martínez-Legaz, Juan Enrique

AU - Volle, Michel

PY - 1999/9/15

Y1 - 1999/9/15

N2 - 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.

AB - 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.

U2 - https://doi.org/10.1006/jmaa.1999.6496

DO - https://doi.org/10.1006/jmaa.1999.6496

M3 - Article

VL - 237

SP - 657

EP - 671

JO - Journal of Mathematical Analysis and Applications

JF - Journal of Mathematical Analysis and Applications

SN - 0022-247X

ER -

Duality in D.C. Programming: The Case of Several D.C. Constraints

Abstract

Access to Document

Fingerprint

Cite this