Blanquero Bravo, RafaelCarrizosa Priego, Emilio José2021-04-262021-04-262000-11-01Blanquero Bravo, R. y Carrizosa Priego, E.J. (2000). On Covering Methods for D.C. Optimization. Journal of Global Optimization, 18 (3), 265-274.0925-50011573-2916https://hdl.handle.net/11441/107818Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization problems. In this note we show that, when the objective f is d.c. and a d.c. decomposition for f is known, the computational burden usually suffered by multivariate covering methods is significantly reduced. With this we extend to the (non-differentiable) d.c. case the covering method of Breiman and Cutler, showing that it is a particular case of the standard outer approximation approach. Our computational experience shows that this generalization yields not only more flexibility but also faster convergence than the covering method of Breiman-Cutler.application/pdf9 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Covering methodsd.c. FunctionsOuter approximationPower diagramsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1023/A:1008366808825