Skip to main content
SpringerLink
Log in

Linear scaling and the DIRECT algorithm

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we discuss the performance of the DIRECT global optimization algorithm on problems with linear scaling. We show with computations that the performance of DIRECT can be affected by linear scaling of the objective function. We also provide a theoretical result which shows that DIRECT does not perform well when the absolute value of the objective function is large enough. Then we present DIRECT-a, a modification of DIRECT, to eliminate the sensitivity to linear scaling of the objective function. We prove theoretically that linear scaling of the objective function does not affect the performance of DIRECT-a. Similarly, we prove that some modifications of DIRECT are also unaffected by linear scaling of the objective function, while the original DIRECT algorithm is sensitive to linear scaling. Numerical results in this paper show that DIRECT-a is more robust than the original DIRECT algorithm, which support the theoretical results. Numerical results also show that careful choices of the parameter ε can help DIRECT perform well when the objective function is poorly linearly scaled.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Björkman M., Holmström K.: Global optimization using the DIRECT algorithm in Matlab. Adv. Model. Optim. 1(2), 17–37 (1999)

    Google Scholar 

  2. Finkel, D.E.: DIRECT optimization user guide. Center for Research and Scientific Coputation CRSC-TR03-11, North Carolina State University, Raleigh, NC, March (2003)

  3. Finkel, D.E., Kelley, C.T.: Convergence analysis of the DIRECT algorithm. Technical Report CRSC-TR04-28, North Carolina State University, Center for Research in Scientific Computation, July (2004)

  4. Finkel, D.E.: Global optimization with the DIRECT algorithm. PHD thesis, North Carolina State University (2005)

  5. Finkel D.E., Kelley C.T.: Additive scaling and the DIRECT algorithm. J. Glob. Optim. 36, 597–608 (2006)

    Article  Google Scholar 

  6. Floudas C.A., Gounaris C.E.: A review of recent advances in global optimizations. J. Glob. Optim. 45, 3–38 (2009)

    Article  Google Scholar 

  7. Floudas C.A.: Deterministic Global Optimization: Theory, Methods and Applications. Kluwer, Dordrecht (2000)

    Book  Google Scholar 

  8. Gablonsky, J.M.: Modifications of the DIRECT algorithm. PHD thesis, North Carolina State University (2001)

  9. Gablonsky J.M., Kelley C.T.: A locally-biased form of the DIRECT algorithm. J. Glob. Optim. 21, 27–37 (2001)

    Article  Google Scholar 

  10. Hendrix E.M.T., Tóth B.G.: Introduction to Nonlinear and Global optimization. Springer, New York, NY (2010)

    Book  Google Scholar 

  11. Holmström K.: The TOMLAB optimization enviroment in Matlab. Adv. Model. Optim. 1(1), 47–69 (1999)

    Google Scholar 

  12. Horst R., Tuy H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)

    Google Scholar 

  13. Huyer W., Neumaier A.: Global optimization by multilevel coordinate search. J. Glob. Optim. 14(4), 331–355 (1999)

    Article  Google Scholar 

  14. Jones D.R., Perttunen C.D., Stuckman B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157–181 (1993)

    Article  Google Scholar 

  15. Jones D.R.: DIRECT Global Optimization Algorithm. The Encyclopedia of Optimization. Kluwer, Dordrecht (1999)

    Google Scholar 

  16. Ljungberg K., Holmgren S.: Simultaneous search for multiple QTL using the global optimization algorithm DIRECT. Bioinformatics 20(12), 1887–1895 (2004)

    Article  Google Scholar 

  17. Liuzzi G., Lucidi S., Piccialli V.: A partion-based global optimization algorithm. J. Glob. Optim. 48, 113–128 (2010)

    Article  Google Scholar 

  18. Liuzzi G., Lucidi S., Piccialli V.: A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. Comput. Optim. Appl. 45(2), 353–375 (2010)

    Article  Google Scholar 

  19. Locatelli M., Schoen F.: Local search based heuristics for global optimization: atomic clusters and beyond. Eur. J. Oper. Res. 222(1), 1–9 (2012)

    Article  Google Scholar 

  20. Pošík, P.: BBOB-Benchmarking the DIRECT global optimization algorithm. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, pp. 2315–2320 (2009)

  21. Sasena, M., Papalambros, P., Goovaerts, P.: Global optimization of problems with disconnected feasible Regions via SurrogateModeling. In: 9th AIAA/ISSMO Symposium onMultidisciplinary Analysis and Optimization, Atlanta, GA (2002)

  22. Sun W.T., Dong Y.: Study of multiscale global optimization based on parameter space partition. J. Glob. Optim. 49(1), 149–172 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Dongguan University of Technology, Dongguan, 523808, China

    Qunfeng Liu

Authors
  1. Qunfeng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qunfeng Liu.

Additional information

This work was supported by NSF of China (No.10971058, No.11071087 and No.11101081).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Q. Linear scaling and the DIRECT algorithm. J Glob Optim 56, 1233–1245 (2013). https://doi.org/10.1007/s10898-012-9952-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9952-x

Keywords

Search

Navigation