一类非线性互补问题的宽邻域预估校正算法

针对一类P-函数非线性互补问题,提出了一种新的内点算法——宽邻域预估校正算法。该算法基于精典预估校正思想,把窄邻域拓展到一个宽邻域里使得算法更快的迭代,给出了应用该算法的具体步骤,讨论了其算法的计算复杂性,分析结果表明,所给方法是一多项式时间算法。通过数值实验验证该算法的有效性。     

基于对角隐式Runge-Kutta公式的无约束优化方法

通过把一个无约束优化问题转化为一个等价的常微分方程,利用二阶半对角隐式Runge Kutta公式构造了求解无约束优化问题的LRKOPT算法。LRKOPT算法具有与IMPBOT方法相似的数值特性,但LRKOPT算法可以看成是最速下降方向与牛顿法方向的非线性组合,而IMPBOT方法为它们两者之间的线性组合。在目标函数为一致凸函数的假设条件下,证明了LRKOPT方法的具有全局收敛和局部超线性收敛性。数值结果表明LRKOPT方法具有很好的数值稳定性并且LRKOPT方法的计算效率优于IMPBOT方法。     

Novel method based on ant colony opti mization for solving ill-conditioned linear systems of equations

1 .INTRODUCTIONStudies have shownthat some systems are highlysen-sitive :a small perturbationin the data can result in alarge changeinthe solutions .Such systems are calledill-conditioned systems .Ill-conditionedlinear systemsof equations have a wide application in many fieldssuch asi magine processing,deconvolution, model pa-rameters esti mation.Because the condition number ofill-conditionedlinear systems of equationsis very big,the data error andthe rounding error inthe computa-tional p…     

New Mehrotra's second order predictor-corrector algorithm for P*(κ)linear complementarity problems

It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P*(κ)linear complementarity problems.This paper presents an extension of the recent variant of Mehrotra's second order algorithm for linear optimijation.It is shown that the iteration-complexity bound of the algorithm is O((4k+3)√14k+5nlog(x0)Ts0/ε),which is similar to that of the corresponding algorithm for linear optimization.     

New Mehrotra＇s second order predictor-corrector algorithm for P_＊（κ） linear complementarity problems

It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P*(κ)- linear complementarity problems. This paper presents an extension of the recent variant of Mehrotra’s second order algorithm for linear optimijation. It is shown that the iteration-complexity bound of the algorithm is O
(4κ + 3)√14κ + 5 n log (x0)Ts0 ε , which is similar to that of the corresponding algorithm for linear optimization.     

基于混合优化方法的立体匹配算法

为了改善线性生长算法获得视差图可靠性差的问题,提出了一种基于混合优化方法的立体匹配算法。该算法综合考虑了计算效率和图像可靠性,将视差匹配转换为多目标优化问题,通过提出的基于模拟退火的鸽群优化算法求解此优化问题,从而实现视差阈值的自适应调节,并获取相应的根点的最优视差值。所提出的混合优化方法较好地克服了局部寻优和全局寻优方法易受初值影响且收敛速度慢的缺点。此外,为了进一步提高视差图可靠性,利用滤波法去除不可靠的视差。仿真结果表明,该算法可以获得更多深度信息,提高了线性生长算法计算视差图的可靠性和鲁棒性。     

广义线性系统的鲁棒状态反馈特征结构配置

针对具有参数摄动广义线性系统的鲁棒状态反馈特征结构配置问题 ,提出了一种优化算法。该算法的设计目标是使闭环特征值和特征向量所满足的方程组关于参数摄动误差为最小。根据广义线性系统状态反馈特征结构配置结果 ,给出了优化指标的完全参数表示。该算法简单、有效 ,且可以给出鲁棒性较强的控制系统。数值例子表明了算法的有效性     

基于混合优化方法的立体匹配算法

为了改善线性生长算法获得视差图可靠性差的问题,提出了一种基于混合优化方法的立体匹配算法。该算法综合考虑了计算效率和图像可靠性,将视差匹配转换为多目标优化问题,通过提出的基于模拟退火的鸽群优化算法求解此优化问题,从而实现视差阈值的自适应调节,并获取相应的根点的最优视差值。所提出的混合优化方法较好地克服了局部寻优和全局寻优方法易受初值影响且收敛速度慢的缺点。此外,为了进一步提高视差图可靠性,利用滤波法去除不可靠的视差。仿真结果表明,该算法可以获得更多深度信息,提高了线性生长算法计算视差图的可靠性和鲁棒性。     

具有引力机制的细菌觅食算法

针对细菌觅食算法中群体感应能力较弱和算法的收敛速度较慢的问题,提出一种具有引力机制的细菌觅食算法。该算法通过引入引力搜索算法中的引力机制来为每个细菌提供寻优的方向;采用细菌觅食算法原有的游动操作来实现局部寻优策略,并在游动之后增加局部维度更新,使得细菌在趋化操作中搜索范围更广;在细菌觅食算法的迁徙操作中引入双高斯函数来重新初始化细菌的位置,从而更好得避免算法陷入局部极值,提高算法的寻优能力。通过实验证明改进后的细菌觅食算法比基本细菌觅食算法拥有更好的寻优能力。     

An Active-Set Projected Trust Region Algorithm for Box Constrained Optimization Problems

An active-set projected trust region algorithm is proposed for box constrained optimization problems, where the given algorithm is designed by three steps. First, the projected gradient direction which normally has better numerical performance is introduced. Second, the projected trust region direction that often possesses good convergence is defined, where the matrix of trust region subproblem is updated by limited memory strategy. Third, in order to get both good numerical performance and convergence, the authors define the final search which is the convex combination of the projected gradient direction and the projected trust region direction. Under suitable conditions, the global convergence of the given algorithm is established. Numerical results show that the presented method is competitive to other similar methods.     

Error Analysis in Frequency Domain for Linear Multipass Algorithms

1. INTRoDUCTIONConsider the dyntalc systemdridt = Ax Bu (1)y = Cx Du (2)whre u is the inPut VaIable; y is the output wriab1e, and x = (x', x2,...,x")" is the state vahale. A, B, Cand D are n x n, n x r, l x n, l x r constant matrices, respectively The transfer function H(s) of equabo (1)and (2) is given bywhere H(s) and oi(i = 0, 1,..., n) are l x r matrices; pi, i = 0, 1,... 1 n are real nUIners. lt can be seen thathe sca1ar relation between every pair of input comPoneni ui and …     

加权直接数据域波束形成

为解决直接数据域(direct data domain,DDD)算法波束形成旁瓣电平高的问题,在约束优化的基础上提出了加权DDD波束形成算法.加权算法首先根据波束指向或者预成波束方向给出合适的主瓣宽度,然后在旁瓣区域约束最高旁瓣电平的高度,达到旁瓣抑制的效果.仿真分析了固定旁瓣电平变化主瓣宽度和固定主瓣宽度变化旁瓣电平两种约束优化形式.结果表明,加权DDD波束形成具有良好性能,能在预设主瓣宽度略宽于原波束主瓣宽度时,旁瓣电平能够满足预设要求.     

Robust predictive control of polytopic uncertain systems with both state and input delays

A robust model predictive control algorithm for discrete linear systems with both state and input delays subjected to constrained input control is presented,where the polytopic uncertainties exist in both state matrices and input matrices.The algorithm optimizes an upper bound with respect to a state feedback control law.The feedback control law is presented based on the construction of a parameter-dependent Lyapunov function.The above optimization problem can be formulated as a LMI-based optimization.The feasibility of the optimization problem guarantees that the algorithm is robustly stable.The simulation results verify the effectiveness of the proposed algorithm.     

基于GA的n维空间优化参数的搜索算法

n维空间中函数优化、模式分类判别函数的确定等问题均可转化为n维空间优化参数的搜索问题。采用人工神经网或梯度爬山算法均存在对优化函数形式有限制及陷入局部最优等局限性。提出一种基于遗传算法的n维空间优化参数的搜索算法,它采用对变化方向和长度的编码以及分层由粗到粗的搜索,能实现全局寻优和改善搜索效率,有效地应用于工业优化、数据挖掘、模式识别等领域,二个实例验证了算法的有效性。     

Seeker optimization algorithm:a novel stochastic search algorithm for global numerical optimization

A novel heuristic search algorithm celled seeker optimization algorithm (SOA) is proposed for the real-parameter optimization.The proposed SOA is based on simulating the act of human searching.In the SOA,search direction is based on empirical gradients by evaluating the response to the position changes,while step length is based on uncertainty reasoning by using a simple fuzzy rule.The effectiveness of the SOA is evaluated by using a challenging set of typically complex functions in comparison to differential evolution (DE) and throe modified particle swarm optimization (PSO) algorithms.The simulation results show that the performance of the SOA is superior or comparable to that of the other algorithms.     

基于粒子群优化算法的USV集群协同避碰方法

针对无人水面艇(unmanned surface vessel, USV)集群在路径规划中的协同避碰问题,提出了基于滚动优化策略结合粒子群优化算法的USV集群协同避碰方法。首先,通过已有雷达、光电等传感器参数指标建立综合视域模型;其次,采取基于正切函数的惯性权重调整结合线性调整学习因子的方法来提高粒子群优化算法的全局搜索能力,同时,在适应度函数中加入转艏角控制来提高路径的平滑性;最后,利用改进后的粒子群优化算法规划出每个综合视域内的路径。仿真实验结果表明,该优化算法能实现USV集群的实时避碰,并快速为USV集群规划出平滑、安全的全局最优无避碰路径。     

Genetic algorithm-based wide-band deterministic maximum likelihood direction finding algorithm

1 .INTRODUCTIONThe problemof esti mating direction of arriving waveusing array signal processing has wide applications inradar ,sonar ,seismology,astronomy and mobile andsatellite communication system, and has receivedmuch attentionin recent years .But the current liter-ature about direction finding algorithmpays more at-tention to narrow-band signal ,that is to say band-width of signal is far smaller than center frequency ofsignal and so envelop of signal keeps invariant in thesensors of …     

最优冗余线阵欠定信号双重构DOA估计方法

针对最小冗余线阵难以用于阵列设计的问题, 设计了一种性能相近的最优冗余线阵, 为实现相应阵列的欠定信号到达角(direction of arrival, DOA)估计, 又提出了一种基于两次重构的快速协方差向量稀疏表示方法。该方法利用凸优化中最优解条件, 实现了Toeplitz协方差矩阵的快速高精度重构, 进而基于构造的协方差向量稀疏表示模型, 实现了欠定信号DOA估计。仿真结果证明, 最优冗余线阵相较于其他稀疏线阵, 耦合影响更低, 测向精度更高, 所提算法较同类算法DOA估计精度更高。     

模拟退火自适应模糊系统学习算法及其在故障诊断中的应用

把自适应模糊系统的学习过程分解为聚类和线性优化,用模拟退火作为聚类的工具,提出了一种基于模拟退火的自适应模糊系统学习算法,用该学习算法建立某非线性伺服机构的模型,并构造基于模型的故障诊断系统,实验取得了良好的结果。     

A POTENTIAL REDUCTION ALGORITHM FOR MONOTONE VARIATIONAL INEQUALITY PROBLEMS

1.IntroductionLetKbeanonemptyclosedconvexsubsetofR"andletF:R"-R"beacontinuousmapping.Avariationalinequalityproblem(VIP)istofindapointx*eKsuchthatThevariationalinequalityproblemmakesitswideappearanceinthestudyofvariousequilibriummodelsineconomics,oper...