International Open Access Journal Platform

logo
open
cover
Current Views: 48233
Current Downloads: 63057

Theoretical Mathematics Study

ISSN Print:2707-4781
ISSN Online:2707-479X
Contact Editorial Office
Join Us
DATABASE
SUBSCRIBE
Journal index
Journal
Your email address

填充函数法求解无约束全局极小化问题

Filling Function Method for Unconstrained Global Minimization

Theoretical Mathematics Study / 2020,2(2):52-58 / 2020-06-10 look1840 look2823
  • Authors: 岳钟琦     
  • Information:
    沈阳师范大学,沈阳
  • Keywords: 全局优化;填充函数法;极小点
  • Global optimization; Filling function method; Minimum point
  • Abstract: 填充函数法是一种求解无约束全局极小化问题的有效方法,这种方法 的关键是构造填充函数。该方法最早是由葛仁溥中提出。文中在考虑优化问题, 根据为 Lipschitz 连续函数,构造了一个新的单参数填充函数,并且该填充函数 在参数较小时能够保证其填充性质。
  • Filling function method is an effective method to solve unconstrained global minimization problem. The key of this method is to construct filling function. This method was first proposed by GE renpuzhong. In this paper, considering the optimization problem, according to Lipschitz continuous function, a new single parameter filling function is constructed, and the filling property can be guaranteed when the parameter is small.
  • DOI: https://doi.org/10.35534/tms.0202008c
  • Cite: 岳钟琦.填充函数法求解无约束全局极小化问题[J].理论数学前沿,2020,2(2):52-58.
Already have an account?
+86 027-59302486