Buscar
Mostrando ítems 1-2 de 2
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 ...
Artículo
Finding GM-estimators with global optimization techniques
(Springer, 2001-01-01)
In this note we address the problem of finding the GM-estimator for the location parameter of a univariate random variable. When this problem is non-convex but d.c. one can use a standard covering method, which, in the ...