基于种群分类的变尺度免疫克隆选择算法

提出了一种基于种群分类的变尺度免疫克隆选择算法.该算法通过对目标函数进行非线性尺度变换,突出了全局最优解的优势地位;建立记忆子群实现了种群代际进化信息的交换;依据亲和度将抗体分为精英子群、普通子群、劣等子群,并对其分别执行自适应高斯变异、均匀变异和消亡更新等策略,增强了算法的局部和全局搜索能力.引入小生境技术提高了抗体...     

一类非线性控制系统模型的数学分析

采用非线性分析的方法,研究了一类非线性控制系统模型,得到解的整体存在性。     

The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem.     

基于近似策略的联合优化方法

针对优化中收敛速度和优化解全局性的问题,提出了一种联合优化方法:构造原问题的近似模型,使用全局优化方法对近似函数进行优化,得到优化点作为初值,再使用局部优化方法对原问题进行优化.为了获得对原问题更好的近似,改进了径向基插值方法,以优化误差的方法来选择参数.利用临近空间机翼模型的优化对算法进行了测试,结果表明,优化参数的...     

带混合边界条件的m——分支半线性反应扩散系统

采用非线性分析的方法与技巧,研究了一类带混合边界条件的m(m≥2)一分支半线性反应扩散系统解的整体存在性.首次给出一种控制条件,使其“IntermediateSums”控制指数可达到 ∞.     

基于迭代卡尔曼粒子滤波的目标跟踪算法研究

粒子滤波在基于图像序列的目标跟踪中获得了广泛应用．针对其计算量较大的问题,提出一种迭代卡尔曼粒子滤波算法,将非线性跟踪问题分解为线性子结构的全局状态空间模型和非线性子结构的局部状态空间模型,利用粒子滤波在卡尔曼滤波估计值的局部范围内搜索目标,逼近真实目标状态．将实验结果与粒子滤波进行比较,结果表明,迭代卡尔曼粒子滤波减少了粒子数,降低了计算量,能够对高机动目标进行实时稳定的跟踪．     

一类带有交错扩散影响的拟线性抛物系统

利用对偶性技巧及一系列非线性分析的方法,研究一类带有交错扩散影响的拟线性抛物系统解的整体存在性.     

基于小波网络的非线性系统辨识研究

小波网络为非线性系统辨识研究提供了一种有效的方法,但目前用于小波网络学习的进化算法易陷入局部极小等缺陷.结合生物免疫系统的概念和理论,在非线性系统辨识中引入基于免疫算法的小波网络.该算法中抗体通过浓度相互作用的机制来促进或抑制抗体的生成,借此保持抗体的多样性,并产生了高亲和力的抗体对种群进行不断的更新,提高了算法的全局搜索能力和收敛速度.最后,把基于免疫算法的小波网络用于一个非线性系统辨识的标准实例中,仿真结果验证了该算法的有效性.     

一类非线性反应扩散控制系统解的整体存在性

研究一类非线性反应扩散控制系统,采用对偶性技巧及Holder不等式方法,得到在Dirichlet边界条件下解的整体存在性.     

马尔可夫随机场中应用蚁群系统的红外图像分割

利用蚁群系统(ACS)的信息正反馈和启发式的搜索特点,针对马尔可夫随机场(MRF)图像模型的局部相关特性和最大后验概率(MAP)估计,可以在较短时间内得到图像分割目标函数的全局最优解,从而可以避免传统模拟退火算法的庞大时间复杂度.通过对军用红外图像的分割实验,可以看出这种算法能够在抗噪声、保留目标边缘和降低时间复杂度方面得到较满意的结果.     

Solution of minisum and minimax location–allocation problems with Euclidean distances

A new method for the solution of minimax and minisum location–allocation problems with Euclidean distances is suggested. The method is based on providing differentiable approximations to the objective functions. Thus, if we would like to locate m service facilities with respect to n given demand points, we have to minimize a nonlinear unconstrained function in the 2m variables x₁,y₁, ?,x_m,y_m. This has been done very efficiently using a quasi-Newton method. Since both the original problems and their approximations are neither convex nor concave, the solutions attained may be only local minima. Quite surprisingly, for small problems of locating two or three service points, the global minimum was reached even when the initial position was far from the final result. In both the minisum and minimax cases, large problems of locating 10 service facilities among 100 demand points have been solved. The minima reached in these problems are only local, which is seen by having different solutions for different initial guesses. For practical purposes, one can take different initial positions and choose the final result with best values of the objective function. The likelihood of the best results obtained for these large problems to be close to the global minimum is discussed. We also discuss the possibility of extending the method to cases in which the costs are not necessarily proportional to the Euclidean distances but may be more general functions of the demand and service points coordinates. The method also can be extended easily to similar three-dimensional problems.     

方差全局灵敏度求解的空间分割结合无迹变换方法

为有效计算基于方差的全局灵敏度指标尤其是非线性程度较高的响应函数的,将积分空间的可加性以及无迹变换结合起来,利用函数在子空间内非线性程度会降低以及无迹变换方法在概率空间内对低非线性函数性质具有强捕捉能力的特点,提出计算基于方差的全局灵敏度指标的高效方法。该方法只需产生一组无迹变换样本就可以近似求得各阶灵敏度指标,并且该近似解随空间分割个数的增加而收敛于真值。通过非线性程度较高的验证算例及工程算例验证了所提方法在处理非线性功能函数上的高效性和准确性。     

Convergence of the bounded fixed charge programming problem

Calculating the solution for a mixed integer linear programming problem has been problematic for any sizable dimension because of the time required. Accordingly, an improved method for the fixed charge problem is presented here. The method is a modification of a bounding technique first suggested by Balinski, and it exploits fully the ratio of costio-use, first described by Cooper and Drebes. It exploits those local properties which have global application so that enumeration is confined to those relatively few combinations which cannot be evaluated otherwise.     

一类非线性反应扩散系统

用非线性分析的方法,研究一类带混合非齐次边界条件的肺动脉毛细血管中血红蛋白的氧化反应扩散系统,并引进局部上、下解的概念,借助构造局部上、下解,在任一有限时间区间内得到解的存在性,从而证明了解是整体存在的.     

一种改进的粒子群优化算法

针对基本粒子群算法存在着收敛速度慢、效率低、易陷入局部最优等缺陷,为了更好地平衡全局和局部搜索能力,在粒子群算法中引入收缩因子,使算法中粒子不仅向种群最优的粒子进行学习,而且向种群中比自己优秀的所有粒子学习,增加了粒子的多样性。实验结果证明,与基本蚁群算法相比,改进的粒子群算法提高了收敛速度和效率,能一定程度地避免局部最优解的产生。     

基于粒子群优化算法的空中目标定位

受干扰条件下,雷达难以对空中目标准确定位。针对这一问题,提出了当多基雷达接收站在空间随机分布时,利用粒子群优化算法解决根据到达时间差对空中目标定位中遇到的非线性最优化问题。所建算法首先初始化一个随机粒子群,然后根据适应度值更新粒子速度和位置,通过迭代搜索最佳坐标。仿真结果表明,在参数设定合理的情况下,该算法性能稳定,能找到逼近全局最优点的解。     

Successive approximation in separable programming: An improved procedure for convex separable programs

We implement a solution procedure for general convex separable programs where a series of relatively small piecewise linear programs are solved as opposed to a single large one, and where, based on bound calculations developed in [13] and [14], the ranges of linearization are systematically reduced for successive programs. The procedure inherits ε-convergence to the global optimum in a finite number of steps, but perhaps its most distinct feature is the rigorous way in which ranges containing an optimal solution are reduced from iteration to iteration. This paper describes the procedure, called successive approximation, discusses its convergence, tightness of the bounds, bound-calculation overhead, and its robustness. It presents a computer implementation to demonstrate its effectiveness for general problems and compares it (1) with the more standard separable programming approach and (2) with one of the recent augmented Lagrangian methods [10] included in a comprehensive study of nonlinear programming codes [12]. It seems clear from over 130 cases resulting from 80 distinct problems studied here that significant savings in terms of computational effort can be realized by a judicious use of the procedure, and the ease with which it can be used is appreciably increased by the robustness it shows. Moreover, for most of these problems, the advantage increases as the size, nonlinearity, and the degree of desired accuracy increase. Other important benefits include significantly smaller storage requirements, the ability to estimate the error in the current solution, and to terminate the algorithm as soon as the acceptable level of accuracy has been achieved. Problems requiring up to about 10,000 nonzero elements in their specification and about 45,000 nonzero elements in the generated separable programs resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in the computations.     

基于改进局部投影算法的非线性时间序列降噪

改进了非线性时间序列降噪的局部投影算法,并应用此算法对含噪Lorenz混沌信号进行降噪,将其与小波分析降噪效果进行比较,实验结果表明:改进的局部投影算法对非线性信号降噪效果十分明显。     

一种用于求解火力分配问题的混沌优化算法

针对火力分配问题,提出了一种新颖的用于解决组合优化问题的混沌优化算法.该算法利用混沌搜索的方法得到新的合法解,充分利用了混沌的随机性和遍历性等特点来改善寻优效率.通过设定逃逸系数,算法在寻优过程中具有了能够跳出局部极小点到达全局最优点的能力.仿真结果表明,该方法的寻优效率明显高于Hopfield等其他优化方法.     

基于改进人工蜂群算法的漏磁缺陷轮廓重构

漏磁缺陷重构是指由检测到的漏磁信号重构缺陷轮廓及参数,是实现漏磁反演的关键。将局部最优解和全局最优解引入到人工蜂群算法(Artificial Bee Colony Algorithm,ABC)中,提出了一种基于改进人工蜂群算法的缺陷重构模型。在该模型中,径向基函数神经网络作为前向模型求解漏磁信号,改进人工蜂群算法用于求解反演问题中的优化问题。将改进人工蜂群算法和基本人工蜂群算法作为反演算法进行了比较,实验结果表明,改进人工蜂群反演算法精度较高,速度较快,同时对实测信号具有鲁棒性,是一种有效可行的漏磁反演新方法。