Skip to main content
Log in

Global minimization of non-smooth unconstrained problems with filled function

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

For smooth or non-smooth unconstrained global optimization problems, an one parameter filled function is derived to identify their global optimizers or approximately global optimizers. The theoretical properties of the proposed function are investigated. Based on the filled function, an algorithm is designed for solving unconstrained global optimization problems. The algorithm consists of two phases: local minimization and filling. The former is intended to minimize the objective function and obtain a local optimizer, the latter aims to find a better initial point for the first phase. Numerical experimentation is also provided. The preliminary computational results confirm that the proposed filled function approach is promising.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Floudas C.A.: Deterministic Global Optimization: Theory, Methods and Application. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  2. Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht (2000)

    MATH  Google Scholar 

  3. Floudas, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization, 2nd edn. Springer, Netherlands (2009)

    MATH  Google Scholar 

  4. Ge R.P.: A filled function method for finding a global minimizer of a funciton of several variables. Math. Program 46, 191–204 (1990)

    Article  MATH  Google Scholar 

  5. Liu X.: Several filled functions with mitigators. Appl. Math. Comput. 133, 375–387 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zhang L.S., Ng C.K., Li D., Tian W.W.: A new filled function method for global optimization. J. Glob. Optim. 28, 17–43 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhang L.S.: On the solving global optimization approach from local to global. J. Chongqing Normal Univ. (Nat. Sci.) 26, 1–6 (2009)

    Google Scholar 

  8. Lin Y.J., Yang Y.J., Zhang L.S.: A novel filled function method for global optimization. J. Korean Math. Soc. 47(6), 1253–1267 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Xu Z., Huang H.X., Pardalos P.M., Xu C.X.: Filled functions for unconstrained global optimization. J. Glob. Optim. 20(1), 49–65 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Clark H.F.: Optimization and Non-Smooth Analysis. SIAM, Philadelphia (1990)

    Book  Google Scholar 

  11. Audet C., Dennis J.E. Jr: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188–217 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Price C.J., Robertson B.L., Reale M.: A hybrid Hooke and Jeeves - direct method for non-smooth optimization. Adv. Model. Optim. 11, 43–61 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Floudas, C.A., Pardalos, P.M.: Collection of test problems for constrained global optimization algorithms. Springer, Lecture Notes Comput Sci 455 (1990)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to W. X. Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W.X., Shang, Y.L., Zhang, L.S. et al. Global minimization of non-smooth unconstrained problems with filled function. Optim Lett 7, 435–446 (2013). https://doi.org/10.1007/s11590-011-0427-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0427-7

Keywords

Navigation