共查询到17条相似文献,搜索用时 109 毫秒
1.
郑应根 《数学物理学报(A辑)》1994,14(2):184-189
本文构造了总体极小值的一类填充函数,它是文[4]的推广,文章对所构造的填充函数的性质作了分析,并给出了一个具体的算法及数值例子。 相似文献
2.
3.
4.
5.
填充函数法是求解全局优化问题的一种有效的确定性算法,方法的关键在于填充函数的构造.对于一般无约束优化问题提出了一个新的无参数填充函数,通过定义证明了此填充函数能保持填充性质.利用其理论性质设计了相应的算法并对几个经典的算例进行了数值实验,实验结果表明算法有效可行. 相似文献
6.
填充函数法是求解全局优化问题的一个重要的确定性算法,这种方法的关键是构造具有良好性质的填充函数.构造了一个新的求解无约束全局优化问题的填充函数.函数连续可微且只包含一个参数.通过分析该函数的相关性质,设计了相应的算法.数值实验表明该算法简单有效. 相似文献
7.
本文研究了一类带等式和不等式约束的双层规划问题,首先利用下层问题的KKT条件将双层规划转化为单层约束规划问题;其次结合罚函数法,构造了一种新的填充函数,并探讨了它的性质;最后基于构造的填充函数,获得了一种求解双层规划问题的填充函数法,并通过数值实验说明了该算法的可行性. 相似文献
8.
填充函数法是求解多变量、多极值函数全局优化问题的有效方法.这种方法的关键是构造填充函数.本文在无Lipschitz连续条件下,对一般无约束最优化问题提出了一类单参数填充函数.讨论了其填充性质,并设计了一个求解约束全局优化问题的填充函数算法,数值实验表明,算法是有效的. 相似文献
9.
非线性整数规划问题是一类复杂的优化问题,填充函数算法是求解整数规划问题的一类有效方法.构造一个新的单参数填充函数,分析并证明了其填充性质;然后,基于该填充函数并结合离散最速下降法提出了一种新的填充函数算法;最后,采用新算法对6个测试函数进行数值实验,结果表明该算法具有良好的计算效果,是有效可行的. 相似文献
10.
11.
In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theoretical and numerical properties of the proposed filled function are investigated. The implementation of the algorithm on seven test problems is reported with satisfactory numerical results. 相似文献
12.
提出一个基于滤子技术的填充函数算法, 用于求解带箱式约束的非凸全局优化问题. 填充函数算法是求解全局优化问题的有效方法之一, 而滤子技术以其良好的数值效果广泛应用于局部优化算法中. 为优化填充函数方法, 应用滤子来监控迭代过程. 首先给出一个新的填充函数并讨论了其特性, 在此基础上提出了理论算法及算法性质. 最后列出数值实验结果以说明算法的有效性. 相似文献
13.
In this paper, a discrete filled function algorithm embedded with continuous approximation is proposed to solve max-cut problems. A new discrete filled function is defined for max-cut problems, and properties of the function are studied. In the process of finding an approximation to the global solution of a max-cut problem, a continuation optimization algorithm is employed to find local solutions of a continuous relaxation of the max-cut problem, and then global searches are performed by minimizing the proposed filled function. Unlike general filled function methods, characteristics of max-cut problems are used. The parameters in the proposed filled function need not to be adjusted and are exactly the same for all max-cut problems that greatly increases the efficiency of the filled function method. Numerical results and comparisons on some well known max-cut test problems show that the proposed algorithm is efficient to get approximate global solutions of max-cut problems. 相似文献
14.
A filled function method for finding a global minimizer of a function of several variables 总被引:45,自引:0,他引:45
Ge Renpu 《Mathematical Programming》1990,46(1-3):191-204
The concept of a filled function is introduced. We construct a particular filled function and analyze its properties. An algorithm for global minimization is generated based on the concept and properties of the filled function. Some typical examples with 1 to 10 variables are tested and computational results show that in most cases this algorithm works better than the tunneling algorithm. The advantages and disadvantages are analyzed and further research directions are discussed. 相似文献
15.
In this paper, a class of parameter-free filled functions is proposed for solving box-constrained system of nonlinear equations. Firstly, the original problem is converted into an equivalent global optimization problem. Subsequently, a class of parameter-free filled functions is proposed for solving the problem. Some properties of the new class of filled functions are studied and discussed. Finally, an algorithm which neither computes nor explicitly approximates gradients during minimizing the filled functions is presented. The global convergence of the algorithm is also established. The implementation of the algorithm on several test problems is reported with satisfactory numerical results. 相似文献
16.
17.
Chengjun Wang Ronghua LuoKun Wu Boshun Han 《Journal of Computational and Applied Mathematics》2011,235(6):1689-1699
In this paper, we transform an unconstrained system of nonlinear equations into a special optimization problem. A new filled function is constructed by employing the special properties of the transformed optimization problem. Theoretical and numerical properties of the proposed filled function are investigated and a solution of the algorithm is proposed. Under some conditions, we can find a solution or an approximate solution to the system of nonlinear equations in finite iterations. The implementation of the algorithm on six test problems is reported with satisfactory numerical results. 相似文献