基于Kriging模型和提升小波变换的随机模型修正北大核心CSCD

为提高随机模型修正效率,减小计算量,提出了一种基于Kriging模型和提升小波变换的随机模型修正方法.首先,对加速度频响函数进行提升小波变换,提取第5层近似系数代替原频响函数.其次,采用拉丁超立方抽样抽取待修正样本,将其作为Kriging模型的输入,对应的近似系数作为输出,构建Kriging模型.提出了一种引入莱维飞行(Lévy flight)的蝴蝶优化算法(LBOA),并将其应用于Kriging模型相关参数的寻优中,提高Kriging模型的精度.最后,以最小化Wasserstein距离为目标,通过鲸鱼优化算法求解待修正参数的均值.测试函数结果表明,LBOA在寻优能力、收敛精度和稳定性等方面有了很大的提升.数值算例的修正误差均低于0.4%,验证了所提模型修正方法具有较高的修正精度和效率.     

生长曲线模型的惩罚最小二乘估计

主要考虑了生长曲线模型中的参数矩阵的估计.首先基于Potthoff-Roy变换后的生长曲线模型,采用不同的惩罚函数:Hard Thresholding函数,LASSO,ENET,改进LASSO,SACD给出了参数矩阵的惩罚最小二乘估计.接着对不做变换的生长曲线模型,直接定义其惩罚最小二乘估计,基于Nelder-Mead法给出了估计的数值解算法.最后对提出的参数估计方法进行了数据模拟.结果表明自适应LASSO在估计方面效果比较好.     

灰色Verhulst模型的改进及其应用

针对灰色Verhulst模型的不足,讨论了灰色Verhulst模型的参数优化问题.首先,利用最小二乘原理给出了一种初值优化的改进模型.其次,在平均相对误差最小准则下,将Verhulst模型的参数优化转化为线性规划问题,然后利用粒子群优化算法估计Verhulst模型中的参数,得到另外一种改进模型.最后,给出了一个仿真实例,结果表明灰色Verhulst模型的改进方法是可行的和有效的,而且具有较高的拟合和预测精度.     

改进的群搜索优化算法

标准的群搜索优化算法(GSO)是一种新的群智能优化算法,适用于解决高维函数的优化问题,而且简单高效,易于实现,但在其优化的后期容易陷入局部最优.为进一步提高其收敛速度和精度,对GSO算法进行了改进.保留其"发现者-加入者"模型,针对GSO算法发现者和游荡者搜索的无目的性,引进最大下降方向和杂交策略,发现者按角度搜索的同时也按最大下降方向进行搜索,游荡者通过基因突变策略的方式生成.通过23个基准测试函数对GSO算法和改进的GSO算法进行测试,结果表明改进的GSO算法在收敛速度和收敛精度上优于标准GSO算法.     

求解高维全局优化问题的改进飞蛾火焰优化算法

针对标准飞蛾火焰优化算法在求解高维全局优化问题时存在收敛速度慢、解精度低和易陷入局部最优等缺点,提出一种改进的飞蛾火焰优化算法(简记为IMFO).该算法首先引入动态惯性权重对飞蛾位置更新方程进行修改以平衡算法的勘探和开采能力.受差分进化算法启发,设计出一种新的随机差分变异策略,以帮助种群跳出局部最优.选取18个高维(100、500和1000维)全局优化问题进行数值测试,结果表明,在相同的适应度函数评价次数下,IMFO在收敛速度和求解精度指标上明显优于基本MFO算法和其他对比算法.     

分离加项阻尼最小二乘法

用阻尼最小二乘法求非线性不等式组(1.1)的数值解时,不能保证满足精度要求的函数在迭代过程中不再超出精度区间,针对这一现象,本文提出一个名叫“分离加项阻尼最小二乘法”的一类一般性算法模型。这个模型能保证收敛到锁向精度的函数,在往后的迭代过程中不再超出精度区间,而未收敛到锁向精度的函数有较快的速度陆续向精度区间收敛,直到全部满足要求迭代才会停止;且具有多种调节功能。     

基于分位点的广义Pareto分布函数最小二乘拟合方法

广义Pareto分布函数(GPD,generalized Pareto distribution)是一种针对随机参数尾部进行渐进插值的方法,能够对高可靠性问题进行评估.应用该函数进行随机参数尾部近似时,需要对函数中的两个重要未知参数进行拟合确定.最常用的拟合方法是最大似然拟合和最小二乘拟合,需要将所有的尾部样本进行计算;需要大量尾部样本,计算效率低.该文提出依据少量的分位点进行最小二乘拟合,既保证了尾部样本空间足够大,同时又降低了计算成本;进一步提出了Kriging模型的两阶段更新,实现了分位点求解的快速收敛.算例表明,该文提出的方法能够快速提高模型精度,求得指定的分位点,而且与基于大量尾部样本的最大似然拟合结果精度一致.     

基于自适应子种群和动态反向学习的改进鸡群算法

针对鸡群算法(Chicken swarm optimization,CSO)求解复杂高维问题收敛精度低、容易陷入局部极值等问题,提出了一种基于自适应子种群和动态反向学习的改进鸡群(ICSO)算法.根据鸡群算法迭代进化进程,自适应确定公鸡种群规模大小,并据此将母鸡种群和小鸡分成若干个子种群;设计进化停滞判定机制,并引入动态反向学习因子以改进算法个体更新方式,有效保持鸡群样本多样性和算法全局深度搜索能力.典型测试函数仿真实验结果表明,与SFLA算法、PSO等智能优化算法相比,ICSO算法具有更高的收敛精度和更优的复杂函数优化能力.     

正态云模型果蝇优化算法及其应用

提出了一种基于正态云模型的果蝇优化算法(NCMFOA).该算法通过直接将果蝇位置赋值给气味浓度判定值和引入正态云模型来刻画果蝇嗅觉搜索行为的随机性与模糊性,从而解决了果蝇优化算法(FOA)不能搜索负值空间的缺陷,并有效克服了FOA算法在解决复杂优化问题时容易陷入局部极值的不足.通过正态云模型熵值的动态调整,使得NCMFOA算法在进化的前期阶段具有较强的随机性与模糊性,以提高算法的全局探索能力;随着迭代次数的增加,算法搜索行为的随机性与模糊性逐渐减弱,使得其局部开发能力逐渐增强,算法收敛精度得到提高.此外,通过引入视觉实时更新方案,进一步加速了算法的收敛速度.用经典的基准测试函数验证了NCMFOA算法的可行性与有效性,结果表明该算法具有收敛速度快、收敛精度高以及鲁棒性好等优点,对于高维复杂优化问题,该算法同样获得了良好的优化效果.将NCMFOA算法用于解决混沌系统的参数估计问题,进一步验证了该算法具有较强的解决实际工程优化问题的能力.     

果蝇优化最小二乘支持向量机混合预测模型—以我国物流需求量预测为例

为解决最小二乘支持向量机参数设置的盲目性,利用果蝇优化算法对其参数进行优化选择,进而构建了果蝇优化最小二乘支持向量机混合预测模型.以我国物流需求量预测为例,验证了该模型的可行性和有效性.实例验证结果表明:与单一最小二乘支持向量机和模拟退火算法优化最小二乘支持向量机预测模型相比,该模型不仅能够有效选择参数值,而且预测精度更高.     

ParEGO extensions for multi-objective optimization of expensive evaluation functions

This paper deals with multi-objective optimization in the case of expensive objective functions. Such a problem arises frequently in engineering applications where the main purpose is to find a set of optimal solutions in a limited global processing time. Several algorithms use linearly combined criteria to use directly mono-objective algorithms. Nevertheless, other algorithms, such as multi-objective evolutionary algorithm (MOEA) and model-based algorithms, propose a strategy based on Pareto dominance to optimize efficiently all criteria. A widely used model-based algorithm for multi-objective optimization is Pareto efficient global optimization (ParEGO). It combines linearly the objective functions with several random weights and maximizes the expected improvement (EI) criterion. However, this algorithm tends to favor parameter values suitable for the reduction of the surrogate model error, rather than finding non-dominated solutions. The contribution of this article is to propose an extension of the ParEGO algorithm for finding the Pareto Front by introducing a double Kriging strategy. Such an innovation allows to calculate a modified EI criterion that jointly accounts for the objective function approximation error and the probability to find Pareto Set solutions. The main feature of the resulting algorithm is to enhance the convergence speed and thus to reduce the total number of function evaluations. This new algorithm is compared against ParEGO and several MOEA algorithms on a standard benchmark problems. Finally, an automotive engineering problem allowing to illustrate the applicability of the proposed approach is given as an example of a real application: the parameter setting of an indirect tire pressure monitoring system.     

一类连续函数模拟退火算法及其收敛性分析

高维连续函数的全局优化问题普遍存在于计算生物学、计算化学等领域．针对这类问题和现有连续函数模拟退火算法的某些不足,本文给出了一类改进的模拟退火算法．采用一种简单的方法证明了算法的全局收敛性．数值结果表明,对于高维连续函数,该算法能够快速有效地收敛到全局最优点,比较了两种新解产生方法的试验结果。     

A hybrid global optimization algorithm for non-linear least squares regression

A hybrid global optimization algorithm is proposed aimed at the class of objective functions with properties typical of the problems of non-linear least squares regression. Three components of hybridization are considered: simplicial partition of the feasible region, indicating and excluding vicinities of the main local minimizers from global search, and computing the indicated local minima by means of an efficient local descent algorithm. The performance of the algorithm is tested using a collection of non-linear least squares problems evaluated by other authors as difficult global optimization problems.     

Non-monotone projection gradient method for non-negative matrix factorization

Since Non-negative Matrix Factorization (NMF) was first proposed over a decade ago, it has attracted much attention, particularly when applied to numerous data analysis problems. Most of the existing algorithms for NMF are based on multiplicative iterative and alternating least squares algorithms. However, algorithms based on the optimization method are few, especially in the case where two variables are derived at the same time. In this paper, we propose a non-monotone projection gradient method for NMF and establish the convergence results of our algorithm. Experimental results show that our algorithm converges to better solutions than popular multiplicative update-based algorithms.     

非线性不等式组的光滑近似方法及其收敛性

将非线性不等式组的求解转化成非线性最小二乘问题,利用引入的光滑辅助函数,构造新的极小化问题来逐次逼近最小二乘问题.在一定的条件下,文中所提出的光滑高斯-牛顿算法的全局收敛性得到保证.适当条件下,算法的局部二阶收敛性得到了证明.文后的数值试验表明本文算法有效.     

Data-driven recursive least squares methods for non-affined nonlinear discrete-time systems

Aiming at identifying nonlinear systems, one of the most challenging problems in system identification, a class of data-driven recursive least squares algorithms are presented in this work. First, a full form dynamic linearization based linear data model for nonlinear systems is derived. Consequently, a full form dynamic linearization-based data-driven recursive least squares identification method for estimating the unknown parameter of the obtained linear data model is proposed along with convergence analysis and prediction of the outputs subject to stochastic noises. Furthermore, a partial form dynamic linearization-based data-driven recursive least squares identification algorithm is also developed as a special case of the full form dynamic linearization based algorithm. The proposed two identification algorithms for the nonlinear nonaffine discrete-time systems are flexible in applications without relying on any explicit mechanism model information of the systems. Additionally, the number of the parameters in the obtained linear data model can be tuned flexibly to reduce computation complexity. The validity of the two identification algorithms is verified by rigorous theoretical analysis and simulation studies.     

A genetic algorithm approach to nonlinear least squares estimation

A common type of problem encountered in mathematics is optimizing nonlinear functions. Many popular algorithms that are currently available for finding nonlinear least squares estimators, a special class of nonlinear problems, are sometimes inadequate. They might not converge to an optimal value, or if they do, it could be to a local rather than global optimum. Genetic algorithms have been applied successfully to function optimization and therefore would be effective for nonlinear least squares estimation. This paper provides an illustration of a genetic algorithm applied to a simple nonlinear least squares example.     

基于正弦控制因子的Lateral变异鲨鱼优化算法

针对传统鲨鱼优化算法在求解高维目标函数时,易早熟收敛,陷入局部最优的缺陷.提出一种基于正弦控制因子的Lateral变异鲨鱼优化算法.通过正弦曲线的特性和自适应惯性权重,改善了传统鲨鱼优化算法中由于随机选取控制因子数值大小可能导致算法在迭代后期全局搜索能力降低的问题,提高了算法在迭代后期的全局收敛能力,并对最佳鲨鱼位置引入Lateral变异策略,加强了算法跳出局部最优的可能性.改进后的算法对多个shifted单峰,多峰以及固定维测试函数进行求解,实验结果表明,对比多种不同优化算法而言,本文所提LSSO算法具有更高的收敛精度和搜索速度.     

A total least squares method for Toeplitz systems of equations

A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an efficient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear systems arising during the Newton iterations. The work of the second author was partially supported by a National Science Foundation Postdoctoral Research Fellowship.     

Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization

The use of surrogate based optimization (SBO) is widely spread in engineering design to reduce the number of computational expensive simulations. However, “real-world” problems often consist of multiple, conflicting objectives leading to a set of competitive solutions (the Pareto front). The objectives are often aggregated into a single cost function to reduce the computational cost, though a better approach is to use multiobjective optimization methods to directly identify a set of Pareto-optimal solutions, which can be used by the designer to make more efficient design decisions (instead of weighting and aggregating the costs upfront). Most of the work in multiobjective optimization is focused on multiobjective evolutionary algorithms (MOEAs). While MOEAs are well-suited to handle large, intractable design spaces, they typically require thousands of expensive simulations, which is prohibitively expensive for the problems under study. Therefore, the use of surrogate models in multiobjective optimization, denoted as multiobjective surrogate-based optimization, may prove to be even more worthwhile than SBO methods to expedite the optimization of computational expensive systems. In this paper, the authors propose the efficient multiobjective optimization (EMO) algorithm which uses Kriging models and multiobjective versions of the probability of improvement and expected improvement criteria to identify the Pareto front with a minimal number of expensive simulations. The EMO algorithm is applied on multiple standard benchmark problems and compared against the well-known NSGA-II, SPEA2 and SMS-EMOA multiobjective optimization methods.