【作者】 吴青；

【导师】 刘三阳；

【作者基本信息】 西安电子科技大学 ， 应用数学， 2005， 硕士

【摘要】 本文对两类全局优化算法(填充函数法和区间算法)作了比较深入的研究，在此基础上对这些算法作了进一步的推广和应用，取得了较为满意的结果，主要内容如下： 在已有的填充函数法的基础上，针对一类非光滑问题提出了一类改进的双参数填充函数法，此填充函数形式简洁，运算量低，大量的数值实验表明与已有相关文献比较该方法的精度和运算效率都有所提高。 对于Lipschitz规划，针对双参数填充函数法在参数选取时的局限性，本文构造了一类应用更广的单参数填充函数，提高了算法的执行效率，理论分析和数值试验均表明该算法比已有的相关算法优越。 利用线性加权法将多目标规划转化为单目标规划，根据其特点，构造了一种新的填充函数法，并利用此算法求得该单目标规划的全局最优解，即原规划的最小弱有效解，数值试验表明该算法是可行有效的，且能保证得到全局最优解。 此外，对离散的minimax问题，通过引入拟偏导数的概念，建立了目标函数的区间扩张和无解区域删除检验原则，基于Moore的区间二分原则提出了求解离散的minimax问题的区间算法．理论分析和数值结果均表明该算法是有效的，在给定精度内能求出全部最优解。更多还原

【Abstract】 This thesis is devoted to two global optimization algorithms, such as a filled function method and an interval algorithm. Their properties and extended applications are discussed on emphasis and the satisfactory results are achieved. The main work of the dissertation can be summarized as follows:Based on some existing filled function methods in the references, a modified filled function method with two adjustable parameters is constructed for nonsmooth optimization. This method is simple and feasible. Theoretical analyses and a large amount of numerical results show that this method is better than other methods in the aspects such as accuracy, runtime and iterative number.The filled function with two parameters has some disadvantages, especially, the excessive restriction on the choices of the parameter values. So a modified filled function with only one parameter is proposed with much improved performance for a Lipschitz programming. Numerical experiments show that the method is efficient.This paper deals with the transformation of a multiple objective programming into a single objective programming. By the character of the single objective programming, a novel filled function method is described. Global optimal solutions of the single objective programming are obtained by the method, i.e., the minimal weakly efficient solutions to the original programming. The numerical tests show that it is practical and effective. Moreover, our filled function guarantees its minimum to be always achieved at a point where its function value is not higher than the function value of the current minimum.Besides all of the above, as to a discrete minimax problem, the interval extension of objective function and region deletion test rules are discussed via quasi-partial derivative. An interval algorithm is described based on the bisection rule of Moore. Theoretical analyses and numerical results show that the algorithm is efficient and that all global optimal points can be found in the given accuracy.更多还原