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

Producció científica: Contribució a revistaArticleRecercaAvaluat per experts

63 Cites (Scopus)

Resum

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.
Idioma originalAnglès
Pàgines (de-a)657-671
RevistaJournal of Mathematical Analysis and Applications
Volum237
DOIs
Estat de la publicacióPublicada - 15 de set. 1999

Fingerprint

Navegar pels temes de recerca de 'Duality in D.C. Programming: The Case of Several D.C. Constraints'. Junts formen un fingerprint únic.

Com citar-ho