dc.contributor
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.contributor
Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.contributor.author
Martínez-Legaz, Juan-Enrique
dc.contributor.author
Ferrer, Albert
dc.identifier
https://hdl.handle.net/2117/1954
dc.description.abstract
There are infinitely many ways of representing a d.c. function as a difference of convex functions. In this paper we analyze how the computational efficiency of a d.c. optimization algorithm depends on the representation we choose for the objective function, and we address the problem of
characterizing and obtaining a computationally optimal representation. We introduce some theoretical concepts which are necessary for this analysis and report some numerical experiments.
dc.format
application/pdf
dc.relation
Project MCYT, DPI 2005-09117-C02-01
dc.rights
http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.rights
Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.subject
Mathematical programming
dc.subject
dc representation
dc.subject
branch and bound
dc.subject
outer approximation
dc.subject
semi-infinite program
dc.subject
Programació (Matemàtica)
dc.subject
Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.title
Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
