Skip to main content
Log in

A filled function method for constrained global optimization

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

Abstract

In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems.

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. Barhen J., Protopopescu V. and Reister D. (1997). TRUST: A deterministic algorithm for global optimization. Science 276: 1094–1097

    Article  Google Scholar 

  2. Benson H.P. (1996). Deterministic algorithm for constrained concave minimization: a unified critical surver. Naval Res. Logist. 43: 765–795

    Article  Google Scholar 

  3. Floudas C.A. and Pardalos P.M. (1990). A Collection of Test Problems for Constrained Global Optimization Algorithms. Springer, Berlin Heidelberg

    Google Scholar 

  4. Floudas C.A., Pardalos P.M., Adjiman C.S., Esposito W.R., Gumus Z.H., Harding S.T., Klepeis J.L., Meyer C.A. and Schweiger C.A. (1999). Handbook of Test Problems in Local and Global Optimization. Kluwer Dordrecht, The Netherlands

    Google Scholar 

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

    Article  Google Scholar 

  6. Ge R. (1990). The globally convexized filled functions for global optimization. Appl. Math. Comput. 35: 131–158

    Article  Google Scholar 

  7. Hoffman K.L.A. (1981). A method for globally minimizing concave functions over convex set. Math. Program. 20: 22–23

    Article  Google Scholar 

  8. Horst R. (1990). Deterministic methods in constrained global optimization: some recent advances and new fields of application. Naval Res. Logist. 37: 433–471

    Article  Google Scholar 

  9. Kanzow C. (2000). Global optimization techniques for mixed complementarity problems. J. Glob. Optim. 16: 1–21

    Article  Google Scholar 

  10. Levy A.V. and Montalvo A. (1985). The tunneling algorithm for the global minimization of function. SIAM J. Sci. Stat. Comput. 6: 15–27

    Article  Google Scholar 

  11. Liu X. (2001). Finding global minimia with a computable filled function. J. Glob. Optim. 19: 151–161

    Article  Google Scholar 

  12. Lucidi S. and Piccialli V. (2002). New classes of globally convexized filled functions for global optimization. J. Glob. Optim. 24: 219–236

    Article  Google Scholar 

  13. Pardalos P.M. and Rosen J.B. (1987). Constrained Global Optimization, Algorithms and Applications. Springer, Berlin

    Google Scholar 

  14. Rinnoy Kan A.H.G. and Timmer G.T. (1987). Stochastic global optimization methods, part I: clustering methods. Math. Program. 39: 27–56

    Article  Google Scholar 

  15. Rinnoy Kan A.H.G. and Timmer G.T. (1987). Stochastic global optimization methods, part II: multi-level methods. Math. Program. 39: 57–78

    Article  Google Scholar 

  16. Sun X.L. and Li D. (1999). Value-estimation function method for constrained global optimization. J. Optim. Theory Appl. 102: 385–409

    Article  Google Scholar 

  17. Tuy H. (1998). Convex Analysis and Global Optimization. Kluwer, Dordrecht, Boston, London

    Google Scholar 

  18. Wu Z.Y., Lee H.W.J., Zhang L.S. and Yang X.M. (2005). A novel filled function method and quasi-filled function method for global optimization. Comput. Optim. Appl. 34(2): 249–272

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  21. Zhu W.X. (2005). A class of filled functions for box constrained continuous global optimization. Appl. Math. Comput 169(1): 129–145

    Article  Google Scholar 

  22. Zhu W.X. (2006). Globally concavized filled function method for the box constrained continuous global minimization problem. Optim. Methods Softw. 21(4): 653–666

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Z. Y. Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, Z.Y., Bai, F.S., Lee, H.W.J. et al. A filled function method for constrained global optimization. J Glob Optim 39, 495–507 (2007). https://doi.org/10.1007/s10898-007-9152-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-007-9152-2

Keywords

Navigation