global minimization

基本解釋

The filled function method is an approach for solving unconstrained global minimization problem.
填充函數(shù)法是一種解無約束全局極小化問題的方法。
The properties of this filled function and a global minimization method based on the filled function are analyzed.
給出一類求解總體極值問題的填充函數(shù)，分析了該填充函數(shù)的特性與基于填充函數(shù)的總體極小化方法。
In this algorithms , it proposes an algorithm for finding global minimization-connecting the method of region constriction, which is more difficult than local minimization;
該算法考慮了優(yōu)化問題的全局性要求—結(jié)合區(qū)間壓縮方法，而這往往比局部最優(yōu)理論和方法困難的多；