全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization

DOI: 10.1155/2010/602831

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper indicates that the filled function which appeared in one of the papers by Y. L. Shang et al. (2007) is also a tunneling function; that is, we prove that under some general assumptions this function has the characters of both tunneling function and filled function. A solution algorithm based on this T-F function is given and numerical tests from test functions show that our T-F function method is very effective in finding better minima. 1. Introduction Because of the advances in science, economics, and engineering, studies on global optimization for the multiminimum nonlinear programming problem have become a topic of great concern. The existence of multiple local minima of a general nonconvex objective function makes global optimization a great challenge [1–3]. Many deterministic methods using an auxiliary function have been proposed to search for a globally optimal solution of a given function of several variables, including filled function method [4] and tunneling method [5]. The filled function method was first introduced by Ge in the paper in [4]. The key idea of the filled function method is to leave from a local minimizer to a better minimizer of with the auxiliary function constructed at the local minimizer of . Geometrically, flattens in the higher basin of than . So a local minimizer of can be found, which lies in the lower basin of than . To minimize with initial point , one can find a lower minimizer of . with replacing , one can construct a new filled function and then find a much lower minimizer of in the same way. Repeating the above process, one can finally find the global minimizer of . The basin of at an isolated minimizer of , , is defined in the paper in [4] as a connected domain which contains and in which the steepest descent trajectory of converges to from any initial point. The hill of at is the basin of at its isolated minimizer . The concept of the filled function is introduced in the paper in [4]. Assume that is a local minimizer of . A function is called a filled function of at if has the following properties.(P1) is a maximizer of and the whole basin of at becomes a part of a hill of .(P2) has no minimizers or saddle points in any higher basin of than .(P3) if has a lower basin than , then there is a point in such a basin that minimizes on the line through and . The form of the filled function proposed in paper [4] is as follows: where and are two adjustable parameters. However, this function still has some unexpected features. First, this function has only a finite number of local minimizers. Second, the

References

[1]  P. M. Pardalos, H. E. Romeijn, and H. Tuy, “Recent developments and trends in global optimization,” Journal of Computational and Applied Mathematics, vol. 124, no. 1-2, pp. 209–228, 2000.
[2]  L. C. W. Dixon, J. Gomulka, and S. E. Herson, “Reflection on global optimization problems,” in Optimization in Action, L. C. W. Dixon, Ed., pp. 398–435, Academic Press, New York, NY, USA, 1976.
[3]  R. Horst, P. M. Pardalos, and N. V. Thoai, Introduction to Global Optimization, vol. 3 of Nonconvex Optimization and Its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1995.
[4]  R. P. Ge, “A filled function method for finding a global minimizer of a function of several variables,” Mathematical Programming, vol. 46, no. 2, pp. 191–204, 1990.
[5]  A. V. Levy and A. Montalvo, “The tunneling algorithm for the global minimization of functions,” SIAM Journal on Science and Statistical Computing, vol. 6, no. 1, pp. 15–29, 1985.
[6]  X. Liu, “A class of generalized filled functions with improved computability,” Journal of Computational and Applied Mathematics, vol. 137, no. 1, pp. 61–69, 2001.
[7]  R. P. Ge and Y. F. Qin, “A class of filled functions for finding global minimizers of a function of several variables,” Journal of Optimization Theory and Applications, vol. 54, no. 2, pp. 241–252, 1987.
[8]  R. P. Ge and Y. F. Qin, “The globally convexized filled functions for global optimization,” Applied Mathematics and Computation, vol. 35, no. 2, pp. 131–158, 1990.
[9]  Z. Xu, H.-X. Huang, P. M. Pardalos, and C.-X. Xu, “Filled functions for unconstrained global optimization,” Journal of Global Optimization, vol. 20, no. 1, pp. 49–65, 2001.
[10]  Y. L. Shang, L. S. Zhang, Y. J. Yang, and Y. M. Liang, “Finding global minimizer with a new filled function for unconstrained global optimization,” in Proceedings of the 6th International Conference on Information and Management Sciences, pp. 839–844, 2007.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133