Additive Scaling and the DIRECT Algorithm

@article{Finkel2006AdditiveSA,
  title={Additive Scaling and the DIRECT Algorithm},
  author={Daniel E. Finkel and C. T. Kelley},
  journal={J. Global Optimization},
  year={2006},
  volume={36},
  pages={597-608}
}
In this paper we show that the convergence behavior of the DIviding RECTangles (DIRECT) algorithm is sensitive to additive scaling of the objective function. We illustrate this problem with a computation and show how the algorithm can be modified to eliminate this sensitivity. 

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

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

Lipschitzian optimization without the Lipschitz constant

  • D. Jones, C. Perttunen, B. Stuckman
  • J. Optim. Theor. Appl. 79(1), 157–181
  • 1993
Highly Influential
10 Excerpts

Encyclopedia of Optimization, Chapter The DIRECT Global Optimization Algorithm, pp

  • C. Floudas, Pardalos, P. eds.
  • 431–440. The Encyclopedia of Optimization. Kluwer…
  • 2001
Highly Influential
3 Excerpts

Towards global optimisation 2, 1 edn

  • L. Dixon, G. Szego
  • North-Holland, New York, NY,
  • 1978
Highly Influential
4 Excerpts

Nonsmooth convergence analysis of DIRECT

  • D. Finkel, C. Kelley
  • Technical Report CRSCTR04-28, Center for Research…
  • 2004
1 Excerpt

Analysis of generalized pattern searches

  • C. Audet, Dennis, J. E.
  • SIAM J. Optim. 13, 889–903
  • 2003
3 Excerpts

Similar Papers

Loading similar papers…