一种求解约束条件下多变量非线性函数所有全局最优解的区间算法  

An Interval Algorithm for Finding all Global Minimizers of a Constrained Nonlinear Function with Several Variables

作　　者：李爽[1] 许才军[1] 王新洲[1] 

机构地区：[1]武汉大学测绘学院,湖北武汉430079

出　　处：《武汉大学学报（理学版）》2003年第5期556-560,共5页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金项目(49904001);高等学校骨干教师资助计划资助(2123)

摘　　要：研究和实践中经常会遇到附有约束条件的非线性优化问题,对这类问题,通常采用随机搜索的方法来解决,但是,随机搜索法不能证明所得到的解就是全局最优解.本文给出了一种求解约束条件下非线性优化问题所有全局最优点和最优值的区间算法,该算法非常宜于解决优化问题,它能求出问题的所有全局最优解,给出解的包含区间,并很容易获得解的逼近误差,这是随机搜索等其他方法做不到的.理论分析和数值结果均表明,区间算法是稳定而可靠的.It is frequently the case that a mathematical model of a system contains limitations on the acceptable values of the parameters. This leads to the most general global optimization topic, namely the global nonlinear constrained optimization problem. General, the random search is used to solve this kind of problem. But the random algorithms can't test if it's result is the optimum of problem. An interval algorithm is established in this paper. This algorithm can solve the global nonlinear constrained optimization problem and is very suitable to solve optimization problem. It can find all global optimums and all global optimizers of the problem, and the inclusion interval of optimizers is output. By these intervals, the approaching errors can be gotten easily. This can't be done by the others algorithms, such as the random search method. Both theory and numerical analysis show that this algorithm is stable and reliable.

关 键 词：多变量非线性函数 非线性优化 约束条件 全局最优解 区问算法 随机搜索 

分 类 号：O224[理学—运筹学与控制论]