Adaptive extremal optimization by detrended fluctuation analysis

Global optimization is one of the key challenges in computational physics as several problems, e.g. protein structure prediction, the low-energy landscape of atomic clusters, detection of community structures in networks, or model-parameter fitting can be formulated as global optimization problems. Extremal optimization (EO) has become in recent years one particular, successful approach to the global optimization problem. As with almost all other global optimization approaches, EO is driven by an internal dynamics that depends crucially on one or more parameters. Recently, the existence of an optimal scheme for this internal parameter of EO was proven, so as to maximize the performance of the algorithm. However, this proof was not constructive, that is, one cannot use it to deduce the optimal parameter itself a priori. In this study we analyze the dynamics of EO for a test problem (spin glasses). Based on the results we propose an online measure of the performance of EO and a way to use this insight to reformulate the EO algorithm in order to construct optimal values of the internal parameter online without any input by the user. This approach will ultimately allow us to make EO parameter free and thus its application in general global optimization problems much more efficient.     

改进退火遗传算法在SQL数据挖掘参数优化中的应用

针对SQL数据挖掘在复杂动力学系统故障诊断中的模式分类问题,以决策树参数优化为例,开展SQL数据挖掘分类算法参数优化研究。目前数据挖掘中的各类算法参数往往根据经验值设定,预测精度不高;只用遗传算法进行参数优化,分类预测结果容易发生振荡和早熟现象。采用改进的退火遗传算法对SQL数据挖掘中的决策树算法参数进行优化,解决了人工经验设置参数效率低下、精度不高的问题,同时实现了全局搜索,快速收敛到全局最优解。     

抛物型方程的演化参数识别方法

给出了一种利用演化计算方法求解微分方程中的参数识别类型反问题的方法。该方法把参数识别问题转化为泛函的优化问题用演化算法来求解,指定待定参数的函数类形式,用遗传算法(Genetic Algorithms)来演化待求参数的最优估计值,并将该方法运用于线性扩散方程和拟线性对流扩散反方程反问题的数值模拟中。     

一类求解箱式约束优化问题的自适应引力搜索算法

为了改进引力搜索算法求解箱式约束优化问题的性能,提出了一类自适应引力搜索算法,新算法定义了算法停滞系数,当算法陷入停滞时,可以自适应的修改引力参数,帮助算法跳出停滞状态;定义了个体相似系数,当种群陷入局部最优时,通过变异策略改善种群的多样性。数值试验结果表明,新算法有效的平衡了全局开发和局部搜索能力,具有更强的全局寻优能力,适于求解复杂优化问题。     

Deep learning-based energy-efficient relay precoder design in MIMO-CRNs

This paper investigates the problem of energy efficient relay precoder design in multiple-input multiple-output cognitive relay networks (MIMO-CRNs). This is a non-convex fractional programming problem, which is traditionally solved using computationally expensive optimization methods. In this paper, we propose a deep learning (DL) based approach to compute an approximate solution. Specifically, a deep neural network (DNN) is employed and trained using offline computed optimal solution. The proposed scheme consists of an offline data generation phase, an offline training phase, and an online deployment phase. The numerical results show that the proposed DNN provides comparable performance at significantly lower computational complexity as compared to the conventional optimization-based algorithm that makes the proposed approach suitable for real-time implementation.     

一种强噪声背景下微弱超声信号提取方法研究

为解决在强噪声背景下获取超声信号的难题,基于粒子群优化算法和稀疏分解理论提出一种强噪声背景下微弱超声信号提取方法.该方法将降噪问题转换为在无穷大参数集上对函数进行优化的问题,首先以稀疏分解理论和超声信号的结构特点为依据构建了粒子群优化算法运行所需要的目标函数及去噪后信号的重构函数,从而将粒子群优化算法和超声信号降噪联系在一起;然后根据粒子群优化算法可以在连续参数空间寻优的特点建立了用于匹配超声信号的连续超完备字典,并采用改进的自适应粒子群优化算法在该字典中对目标函数进行优化;最后根据对目标函数在字典上的优化结果确定最优原子,并利用最优原子按照重构函数重构出降噪后的超声信号.通过对仿真超声信号和实测超声信号的处理,结果表明本文提出的方法可以有效提取信噪比低至-4 dB的强噪声背景下的微弱超声信号,且和基于自适应阈值的小波方法相比本文方法表现出更好的降噪性能.     

Optimal Control of Time-Delay Fractional Equations via a Joint Application of Radial Basis Functions and Collocation Method

A novel approach to solve optimal control problems dealing simultaneously with fractional differential equations and time delay is proposed in this work. More precisely, a set of global radial basis functions are firstly used to approximate the states and control variables in the problem. Then, a collocation method is applied to convert the time-delay fractional optimal control problem to a nonlinear programming one. By solving the resulting challenge, the unknown coefficients of the original one will be finally obtained. In this way, the proposed strategy introduces a very tunable framework for direct trajectory optimization, according to the discretization procedure and the range of arbitrary nodes. The algorithm’s performance has been analyzed for several non-trivial examples, and the obtained results have shown that this scheme is more accurate, robust, and efficient than most previous methods.     

Stochastic global optimization as a filtering problem

We present a reformulation of stochastic global optimization as a filtering problem. The motivation behind this reformulation comes from the fact that for many optimization problems we cannot evaluate exactly the objective function to be optimized. Similarly, we may not be able to evaluate exactly the functions involved in iterative optimization algorithms. For example, we may only have access to noisy measurements of the functions or statistical estimates provided through Monte Carlo sampling. This makes iterative optimization algorithms behave like stochastic maps. Naive global optimization amounts to evolving a collection of realizations of this stochastic map and picking the realization with the best properties. This motivates the use of filtering techniques to allow focusing on realizations that are more promising than others. In particular, we present a filtering reformulation of global optimization in terms of a special case of sequential importance sampling methods called particle filters. The increasing popularity of particle filters is based on the simplicity of their implementation and their flexibility. We utilize the flexibility of particle filters to construct a stochastic global optimization algorithm which can converge to the optimal solution appreciably faster than naive global optimization. Several examples of parametric exponential density estimation are provided to demonstrate the efficiency of the approach.     

Frequency-invariant robust adaptive beamforming based on interference covariance matrix reconstruction

Consider the problems of frequency-invariant beampattern optimization and robustness in broadband beamforming.Firstly,a global optimization algorithm,which is based on phase compensation of the array manifolds,is used to construct the frequency-invariant beampattern.Compared with some methods presented recently,the proposed algorithm is not only available to get the global optimal solution,but also simple for physical realization.Meanwhile,a robust adaptive broadband beamforming algorithm is also derived by reconstructing the covariance matrix.The essence of the proposed algorithm is to estimate the space-frequency spectrum using Capon estimator firstly,then integrate over a region separated from the desired signal direction to reconstruct the interference-plus-noise covariance matrix,and finally caleulate the adaptive beamformer weights with the reconstructed matrix.The design of beamformer is formulated as a convex optimization problem to be solved.Simulation results show that the performance of the proposed algorithm is almost always close to the optimal value across a wide range of signal to noise ratios.     

Optimization of a total internal reflection lens by using a hybrid Taguchi-simulated annealing algorithm

In this paper, we propose a new method for optimization of a total internal reflection (TIR) lens by using a hybrid Taguchi-simulated annealing algorithm. The conventional simulated annealing (SA) algorithm is a method for solving global optimization problems and has also been used in non-imaging systems in recent years. However, the success of SA depends heavily on the annealing schedule and initial parameter setting. In this study, we successfully incorporated the Taguchi method into the SA algorithm. The new hybrid Taguchi-simulated annealing algorithm provides more precise search results and has lower initial parameter dependence.     

Acceleration of Global Optimization Algorithm by Detecting Local Extrema Based on Machine Learning

This paper features the study of global optimization problems and numerical methods of their solution. Such problems are computationally expensive since the objective function can be multi-extremal, nondifferentiable, and, as a rule, given in the form of a “black box”. This study used a deterministic algorithm for finding the global extremum. This algorithm is based neither on the concept of multistart, nor nature-inspired algorithms. The article provides computational rules of the one-dimensional algorithm and the nested optimization scheme which could be applied for solving multidimensional problems. Please note that the solution complexity of global optimization problems essentially depends on the presence of multiple local extrema. In this paper, we apply machine learning methods to identify regions of attraction of local minima. The use of local optimization algorithms in the selected regions can significantly accelerate the convergence of global search as it could reduce the number of search trials in the vicinity of local minima. The results of computational experiments carried out on several hundred global optimization problems of different dimensionalities presented in the paper confirm the effect of accelerated convergence (in terms of the number of search trials required to solve a problem with a given accuracy).     

基于混合群智能优化算法的混沌系统参数估计

混沌系统的未知系统参数估计是实现混沌控制和同步的首要问题,通过构造一个合理的适应度函数,可将其转化为一个多维搜索空间的优化问题.提出一种融合改进骨干粒子群算法与改进差分进化算法的混合群智能优化方法来解决上述优化问题.对骨干粒子群算法中的粒子位置更新机制以及差分进化算法中的变异操作、交叉操作、交叉概率因子的设计等进行改进,有效兼顾了种群的多样性与算法的收敛性.在此基础上,讨论骨干粒子群优化算法与差分进化的融合优化策略,实现两个算法的协同进化,进一步提高算法的综合优化性能.用6个基准测试函数以及Lorenz混沌系统为例进行仿真实验,结果表明该方法具有全局寻优能力强、收敛速度快、搜索精度高、稳健性好等优点.     

Joint UAVs’ Load Balancing and UEs’ Data Rate Fairness Optimization by Diffusion UAV Deployment Algorithm in Multi-UAV Networks

Unmanned aerial vehicles (UAVs) can be deployed as base stations (BSs) for emergency communications of user equipments (UEs) in 5G/6G networks. In multi-UAV communication networks, UAVs’ load balancing and UEs’ data rate fairness are two challenging problems and can be optimized by UAV deployment strategies. In this work, we found that these two problems are related by the same performance metric, which makes it possible to optimize the two problems simultaneously. To solve this joint optimization problem, we propose a UAV diffusion deployment algorithm based on the virtual force field method. Firstly, according to the unique performance metric, we define two new virtual forces, which are the UAV-UAV force and UE-UAV force defined by FU and FV, respectively. FV is the main contributor to load balancing and UEs’ data rate fairness, and FU contributes to fine tuning the UEs’ data rate fairness performance. Secondly, we propose a diffusion control stratedy to the update UAV-UAV force, which optimizes FV in a distributed manner. In this diffusion strategy, each UAV optimizes the local parameter by exchanging information with neighbor UAVs, which achieve global load balancing in a distributed manner. Thirdly, we adopt the successive convex optimization method to update FU, which is a non-convex problem. The resultant force of FV and FU is used to control the UAVs’ motion. Simulation results show that the proposed algorithm outperforms the baseline algorithm on UAVs’ load balancing and UEs’ data rate fairness.     

A new approach of optimal control for a class of continuous-time chaotic systems by an online ADP algorithm

We develop an online adaptive dynamic programming （ADP） based optimal control scheme for continuous-time chaotic systems. The idea is to use the ADP algorithm to obtain the optimal control input that makes the performance index function reach an optimum. The expression of the performance index function for the chaotic system is first presented. The online ADP algorithm is presented to achieve optimal control. In the ADP structure, neural networks are used to construct a critic network and an action network, which can obtain an approximate performance index function and the control input, respectively. It is proven that the critic parameter error dynamics and the closed-loop chaotic systems are uniformly ultimately bounded exponentially. Our simulation results illustrate the performance of the established optimal control method.     

A Hybrid Rao-NM Algorithm for Image Template Matching

This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems.     

基于量子并行粒子群优化算法的分数阶混沌系统参数估计

分数阶混沌系统参数估计的本质是多维参数优化问题, 其对于实现分数阶混沌控制与同步至关重要. 提出一种基于量子并行特性的粒子群优化新算法, 用于解决分数阶混沌的系统参数估计问题. 利用量子计算的并行特性, 设计出了一种新的量子编码, 使每代运算的可计算次数呈指数增加. 在此基础上, 构建了由量子当前旋转角、个体最优旋转角和全局最优旋转角共同组成的粒子演化方程, 以约束粒子在量子空间中的运动行为, 使算法的搜索能力得到了较大提高. 以分数阶Lorenz混沌系统和分数阶Chen混沌系统的参数估计为例, 进行了未知参数估计的数值仿真, 结果显示本算法具有良好的有效性、鲁棒性和通用性.     

基于干扰协方差矩阵重构的恒定束宽鲁棒自适应波束形成

针对宽带波束形成中的恒定束宽波束响应优化设计问题与鲁棒性问题展开研究。首先,提出一种基于相位补偿的恒定束宽全局优化设计方法,通过对阵列流形向量进行相位补偿来设计恒定束宽波束,与现有的一些方法相比,该方法不仅能获得全局最优解,而且物理实现简单。同时,还提出一种基于协方差矩阵重构的鲁棒自适应宽带波束形成算法。该算法采用Capon估计器估计样本数据的空间一频率谱密度函数,然后对期望信号波达方向之外的角度区间进行积分来重构干扰加噪声协方差矩阵,最后利用重构的协方差矩阵设计自适应波束形成器权系数。该波束形成器设计问题被表述成凸优化问题求解。仿真结果表明,在整个输入信噪比范围内,该算法几乎都能获得接近理想值的输出信干噪比。      

Chaotic biogeography-based optimization approach to target detection in UAV surveillance

This paper describes a novel chaotic biogeography-based optimization (CBBO) algorithm for target detection by means of template matching to meet the request of unmanned aerial vehicle (UAV) surveillance. Template matching has been widely applied in movement tracking and other fields and makes excellent performances in visual navigation. Biogeography-based optimization (BBO) algorithm emerges as a new kind of optimization method on the basis of biogeography concept. The idea of migration and mutation strategy of species in BBO contributes to solving optimization problems. Our work adds chaotic searching strategy into BBO and applies CBBO in template matching. By utilizing chaotic strategy, the population ergodicity and global searching ability are improved, thus avoiding local optimal solutions during evolution. Applying the algorithm to resolving template matching problem overcomes the defects of common image matching. Series of experimental results demonstrate the feasibility and effectiveness of our modified approach over other algorithms in solving template matching problems. Our modified BBO algorithm performs better in terms of convergence property and robustness when compared with basic BBO.     

An approximation for the boundary optimal control problem of a heat equation defined in a variable domain

In this paper, we consider a numerical approximation for the boundary optimal control problem with the control constraint governed by a heat equation defined in a variable domain. For this variable domain problem, the boundary of the domain is moving and the shape of theboundary is defined by a known time-dependent function. By making use of the Galerkin finite element method, we first project the original optimal control problem into a semi-discrete optimal control problem governed by a system of ordinary differential equations. Then, based on the aforementioned semi-discrete problem, we apply the control parameterization method to obtain an optimal parameter selection problem governed by a lumped parameter system, which can be solved as a nonlinear optimization problem by a Sequential Quadratic Programming （SQP） algorithm. The numerical simulation is given to illustrate the effectiveness of our numerical approximation for the variable domain problem with the finite element method and the control parameterization method.     

混沌免疫多目标算法求解认知引擎参数优化问题

合理的认知引擎参数设置可以提高频谱的使用性能. 通过分析认知无线网络中的认知引擎参数配置, 给出了其数学模型, 并将其转化为一个多目标优化问题, 进而提出一种基于混沌免疫多目标优化的求解方法. 算法使用Logistic混沌映射初始化种群, 并在每一代将混沌特性用于最优解集的搜索; 设计了适合此问题的免疫克隆算子和抗体群更新算子, 保证了Pateto最优解集分布的多样性和均匀性. 最后, 在多载波环境下对算法进行了仿真实验. 结果表明, 算法可以根据信道条件和用户服务的动态变化, 自适应调整各个子载波的发射功率和调制方式, 可以求出更多满足偏好需求的解, 满足认知引擎参数优化要求.