On Covering Methods for D.C. Optimization

@article{Blanquero2000OnCM,
  title={On Covering Methods for D.C. Optimization},
  author={Rafael Blanquero and Emilio Carrizosa},
  journal={J. Global Optimization},
  year={2000},
  volume={18},
  pages={265-274}
}
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 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
8 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

1988),Optimization methods in Statistics

  • A. Cutler
  • PhD. Thesis,
  • 1988
Highly Influential
4 Excerpts

Localización de servicios en el plano mediante técnicas de optimización d.c

  • R. Blanquero
  • 1999
1 Excerpt

1998),Convex Analysis and Global Optimization

  • H. Tuy
  • 1998

A Method Using Local Tuning for Minimizing Functions with Lipschitz Derivatives

  • Sergeyev, Ya.D
  • 1998
1 Excerpt

Spatial Tessellations: Concepts and Applications of Voronoi Diagrams

  • A. Okabe, B. Boots, K. Sugihara
  • 1995
1 Excerpt

eds.),Handbook of Global Optimization

  • H. Tuy
  • D.C. Optimization: Theory, Methods and Algorithms…
  • 1995

Similar Papers

Loading similar papers…