期刊文献+

求全局最优化问题的一种新定义的填充函数 被引量:1

New definition of filled function applied to global optimization
下载PDF
导出
摘要 提出了一种新的填充函数定义和填充函数,这种填充函数只含有一个参数且可以用来寻找全局优化问题的最优点.经过理论分析提出了一种新的填充函数算法.数值实验验证了此算法的有效性. A novel definition of filled function and a new filled function with one parameter are proposed to find the global minimizer. A new filled function algorithm is developed according to the theoretical analysis. Some numerical results demonstrate the efficiency of this algorithm.
机构地区 上海大学理学院
出处 《应用数学与计算数学学报》 2016年第1期128-137,共10页 Communication on Applied Mathematics and Computation
基金 国家自然科学基金资助项目(11471062)
关键词 全局优化 局部极小点 填充函数 填充函数算法 global optimization local minimizer filled function filled function algorithm
  • 相关文献

参考文献11

  • 1Levy A V, Montalvo A. The tunneling algorithm for the global minimization of function [J]. SIAM Journal on Scientific and Statistical Computing, 1985, 6(1): 15-29.
  • 2郑权,蒋百川,庄松林.一个求总极值的方法[J].应用数学学报,1978,1(2):161-174.
  • 3Ge R P. A filled function method for finding a global minimizer of a function of several variables [J]. Mathematical Programming, 1990, 46: 191-204.
  • 4Ge R P. Finding more and more solutions of a system of nonlinear equations [J]. Applied Mathematics and Computation, 1990, 36: 15-30.
  • 5Ge R P. The theory of filled function methods for finding global minimizers of nonlinearly constrained minimization problems [J]. Journal of Computation and Mathematics, 1987, 5: 1-9.
  • 6Zheng Q, Zhang L S. Penalty functions and global optimization problems with inequMity constraints [J]. Mathematica Numerica Sinica, 1980, 2(2): 146-153.
  • 7Elmi A, Solimanpur M, TopMoglu S. A simulated annealing Mgorithm for the job shop cell scheduling problem with intercellular moves and reentrant [J]. Computers and Industrial En- gineering, 2001, 1(61): 171-178.
  • 8Michalewicz Z. Genetic Algorithms+Data Stuctures=Evolution Programs [M]. Berlin/Heidel- berg: Springer-Verlag, 1996.
  • 9Horst R. A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization [J]. Journal of Optimization Theory and Applications, 1986, 51: 271-291.
  • 10Tuy H, Horst R. Convergence and restart in branch-and-bound algorithm for global optimiza- tion application to concave minimization and D.C. optimization problems [J]. Mathematical Programming, 1989, 41: 161-183.

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部