论文

一种新的全局优化无参数填充函数方法

展开
  • 1. 北方民族大学数学与信息科学学院, 宁夏银川 750021
    2. 金陵科技学院理学院, 江苏南京 211169
    3. 宁夏大学数学统计学院, 宁夏银川 750021
高岳林 E-mail: gaoyuelin@163.com

收稿日期: 2021-12-19

  网络出版日期: 2025-06-12

基金资助

国家自然科学基金(11961001);宁夏高等教育一流学科建设项目(NXYLXK2017B09);北方民族大学重大专项(ZDZX201901);北方民族大学研究生创新资助项目(YCX22096)

版权

运筹学学报编辑部, 2025, 版权所有,未经授权,不得转载。

A new non parameter-filled function method for global optimization

Expand
  • 1. School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, Ningxia, China
    2. College of Science, Jinling Institute of Technology, Nanjing 211169, Jiangsu, China
    3. School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, Ningxia, China

Received date: 2021-12-19

  Online published: 2025-06-12

Copyright

, 2025, All rights reserved. Unauthorized reproduction is prohibited.

摘要

填充函数法是一种用于寻找无约束优化问题全局最优解的确定性方法, 这种方法的核心技术是构造填充函数, 使得迭代过程不断跳出当前的局部极小点。目前见到的填充函数一般都含有参数, 而参数的选取对算法的计算效果影响较大。本文利用填充函数的定义, 具体构造出一个新的无参数填充函数, 由此提出了新的全局优化无参数填充函数方法, 数值实验表明, 该方法是可行的和有效的, 具有更好的全局寻优能力。

本文引用格式

马素霞, 高岳林, 林洪伟, 张博 . 一种新的全局优化无参数填充函数方法[J]. 运筹学学报, 2025 , 29(2) : 141 -157 . DOI: 10.15960/j.cnki.issn.1007-6093.2025.02.011

Abstract

The filled function method is a kind of deterministic method, which is adopted to find the global optimal solution for the unconstrained optimization problem. The core technique of this method is to construct the filled function, which is such that the iterative process of the algorithm constantly jump out of the current local minimizer. Currently, the filled function generally contains parameters, and the selection of parameters has a great influence on the computation effect of the algorithm. In this paper, a new non parameter-filled function is constructed by using the definition of filled function, and a new global optimization method is developed. Numerical experiments illustrate that this method is feasible and effective, and has better global optimization ability.

参考文献

1 Ge R P . A filled function method for finding a global minimizer of a function of several variables[J]. Mathematical Programming, 1990, 46 (2): 191- 204.
2 Ge R P , Qin Y F . A class of filled functions for finding global minimizers of a function of several variables[J]. Applied Mathematic and Computation, 1987, 54 (2): 241- 252.
3 Levy A V , Montalvo A . The tunneling algorithm for the global minimization of functions[J]. The SIAM Journal on Scientific Computing, 1985, 6 (1): 15- 29.
4 申培萍. 全局优化方法[M]. 北京: 科学出版社, 2006: 19- 32.
5 Sreelaja N K . Ant colony optimization based light weight binary search for efficient signature matching to filter ransomware[J]. Applied Soft Computing, 2021, 111 (10): 107635.
6 Yeh W C , Chuang M C . Using multi-objective genetic algorithm for partner selection in green supply chain problems[J]. Expert Systems with Applications, 2011, 38 (4): 4244- 4253.
7 黄友锐. 智能优化算法及其应用[M]. 北京: 国防工业出版社, 2008: 9- 138.
8 Gao C L , Yang Y J , Han B S . A new class of filled functions with one parameter for global optimization[J]. Computers and Mathematics with Applications, 2011, 62 (6): 2393- 2403.
9 El-Gindy T M , Salim M S , Ahmed A I . A new filled function method applied to unconstrained global optimization[J]. Applied Mathematic and Computation, 2016, 273 (1): 1246- 1256.
10 Yang Y J , Shang Y L . A new filled function method for unconstrained global optimization[J]. Applied Mathematic and Computation, 2006, 173 (1): 501- 512.
11 Wu Z Y , Bai F S , Lee H W J , et al. A filled function method for constrained global optimization[J]. Journal of Global Optimization, 2007, 39 (4): 495- 507.
12 Liu X . A class of generalized filled functions with improved computability[J]. Journal of Computational and Applied Mathematics, 2001, 137 (1): 61- 69.
13 Wang C , Yang Y , Li J . A new filled function method for unconstrained global optimization[J]. Journal of Computational and Applied Mathematics, 2009, 225 (1): 68- 79.
14 Lin H W , Gao Y L , Wang X L , et al. A filled function which has the same local minimizer of the objective function[J]. Optimization Letters, 2019, 13 (4): 761- 776.
15 Lin H W , Wang Y P , Gao Y L , et al. A filled function method for global optimization with inequality constraints[J]. Computational and Applied Mathematics, 2018, 37 (2): 1524- 1536.
16 吴佩佩, 高岳林. 一个新的非线性整数规划问题的单参数填充函数算法[J]. 运筹学学报, 2017, 21 (3): 111- 118.
17 He S X , Chen W L , Wang H . A new filled function algorithm for constrained global optimization problems[J]. Applied Mathematic and Computation, 2011, 217 (12): 5853- 5859.
18 Liu X . Finding global minima with a computable filled function[J]. Journal of Global Optimization, 2001, 19 (2): 151- 161.
19 赵丹, 高岳林. 非线性整数规划问题的无参数填充函数算法[J]. 运筹学学报, 2020, 24 (4): 63- 73.
20 高岳林, 吴佩佩. 非线性整数规划的一个新的无参数填充函数算法[J]. 计算数学学报, 2017, 39 (3): 321- 327.
21 Ahmed A I . A new parameter free filled function for solving unconstrained global optimization problems[J]. International Journal of Computer Mathematics, 2021, 98 (1): 106- 119.
22 Pandiya R , Widodo W , Salmah , et al. Non parameter-filled function for global optimization[J]. Applied Mathematic and Computation, 2021, 391, 125642.
23 Liu H Y , Wang Y P , Guan S W , et al. A new filled function method for unconstrained global optimization[J]. Applied Mathematic and Computation, 2017, 94 (12): 2283- 2296.
24 Ma S Z , Yang Y J , Liu H Q . A parameter free filled function for unconstrained global optimization[J]. Applied Mathematic and Computation, 2009, 215 (10): 3610- 3619.
25 Lin H W , Wang Y P , Fan L . A filled function method with one parameter for unconstrained global optimization[J]. Applied Mathematic and Computation, 2011, 218 (7): 3776- 3785.
26 Lin H W , Gao Y L , Wang Y P . A continuously differentiable filled function method for global optimization[J]. Numerical Algorithms, 2014, 66 (3): 511- 523.
27 Gao Y L , Yang Y J , You M . A new filled function method for global optimization[J]. Applied Mathematic and Computation, 2015, 268, 685- 695.
文章导航

/