Buscar
Mostrando ítems 1-1 de 1
Artículo
On Covering Methods for D.C. Optimization
(Springer, 2000-11-01)
Covering 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 ...