2026-04-14T03:20:13Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/19542025-07-17T00:03:49Zcom_2072_1033col_2072_452950

Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function Martínez-Legaz, Juan-Enrique Ferrer, Albert Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització Mathematical programming dc representation branch and bound outer approximation dc program semi-infinite program Programació (Matemàtica) Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming 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. 2007-06 Article https://hdl.handle.net/2117/1954 eng Project MCYT, DPI 2005-09117-C02-01 http://creativecommons.org/licenses/by-nc-nd/2.5/es/ Open Access Attribution-NonCommercial-NoDerivs 2.5 Spain 12 p. application/pdf