Skip to main content
Log in

A Class of Augmented Filled Functions

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The filled function method is an effective approach to find the global minimizer. Two of the recently proposed filled functions are H(X) and L2(X). Although their numerical behavior is acceptable, they are not defined everywhere. This paper proposes a class of augmented filled functions with improved analyticity. Issues covered in the presented work include: theoretical properties, convergence analysis, geometric interpretation, algorithms, and numerical experiments. The overall performance of the new approach is comparable to the recently proposed ones.

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. C. Carroll, “The created response surface technique for optimization nonlinear restrained systems,” Operations Research, vol. 9, pp. 169–184, 1961.

    MATH  MathSciNet  Google Scholar 

  2. R. Courant, “Variational methods for the solution of problems of equilibrium and vibration,” Bulletin of the American Mathematical Society, vol. 49, pp. 1–23, 1943.

    MATH  MathSciNet  Google Scholar 

  3. A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley: New York, 1968.

    Google Scholar 

  4. R. Ge, “A filled function method for finding a global minimizer of a function of several variables,” Mathematical Programming, vol. 46, pp. 91–204, 1990.

    Google Scholar 

  5. R. Ge and Y. Qin, “A class of filled functions for finding global minimizers of a function of several variables,” Journal of Optimization Theory and Applications, vol. 54, pp. 241–252, 1987.

    Article  MathSciNet  Google Scholar 

  6. R. Horst and H. Tuy, Global Optimization (Deterministic Approaches), 3rd edition, Springer-Verlag: Berlin, 1996.

    Google Scholar 

  7. A. Levy and A. Montalvo, “The tunneling algorithm for the global minimization of functions,” SIAM Journal on Scientific and Statistical Computing, vol. 6, pp. 15–29, 1985.

    Article  MathSciNet  Google Scholar 

  8. X. Liu, Several New Optimization Methods and Their Application to Electrical Engineering, M.Sc. thesis, Department of Electrical Engineering, Jiaotong University, 1987.

  9. X. Liu, “Finding global minima with a computable filled function,” Journal of Global Optimization, vol. 19, pp. 151–161, 2001.

    Article  MATH  Google Scholar 

  10. X. Liu, “Several filled functions with mitigators,” Applied Mathematics and Computation, vol. 133, pp. 375–387, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Pintér, Global Optimization in Action, Kluwer: Dordrecht, 1996.

    Google Scholar 

  12. M. Powell, “An efficient method for finding the minimum of a function of several variables without calculating derivatives,” Computer Journal, vol. 7, pp. 155–162, 1964.

    Article  MATH  MathSciNet  Google Scholar 

  13. K. Toh, “Global optimization by monotonic transformation,” Computational Optimization and Application, vol. 23, pp. 77–99, 2002.

    MATH  MathSciNet  Google Scholar 

  14. A. Törn and A. Žilinskas, Global Optimization, Springer-Verlag: Berlin, 1989.

    Google Scholar 

  15. L. Vicente and P. Calamai, “Bilevel and multilevel programming: A bibliography review,” Journal of Global Optimization, vol. 5, pp. 291–306, 1994.

    Article  MathSciNet  Google Scholar 

  16. Z. Xu, H. Huang, P. Pardalos, and C. Xu, “Filled functions for unconstrained global optimization,” Journal of Global Optimization, vol. 20, pp. 49–65, 2001.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xian Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, X. A Class of Augmented Filled Functions. Comput Optim Applic 33, 333–347 (2006). https://doi.org/10.1007/s10589-005-3061-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-005-3061-4

Keywords

Navigation