基于一个新核函数的半定规划的内点算法的复杂性分析

Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with simple algebraic expression is proposed. Based on this kernel function, a primal-dual interior-point methods （IPMs） for semidefinite optimization （SDO） is designed. And the iteration complexity of the algorithm as O（n^3/4 log n/ε） with large-updates is established. The resulting bound is better than the classical kernel function, with its iteration complexity O（n log n/ε） in large-updates case.     

凸二次规划的一个新原-对偶内点算法

In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization (CQO) based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method (IPM) to O (√nlognlogn/ε), which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter.     

一类关于半正定规划的多项式原对偶内点算法

1 Introduction Interior-point methods (IPMs) for semidefinite opti-mization (SDO) have been studied intensively,due totheir polynomial complexity and practical efficiency.In the past decade , SDO has become a popular re-search area in mathematical programming when it be-came clear that the algorithm for linear opti mization(LO) can often be extended to the more general SDOcase. Other two factors are also responsible for thisincreasing interest in SDO. Firstly, SDO has a wideapplication…     

线性约束凸规划的一个新原-对偶路径-跟踪内点算法

In this paper, a primal-dual path-following interior-point algorithm for linearly constrained convex optimization （LCCO） is presented. The algorithm is based on a new technique for finding a class of search directions and the strategy of the central path. At each iteration, only full-Newton steps are used. Finally, the favorable polynomial complexity bound for the algorithm with the small-update method is deserved, namely, O（√nlog n/ε）.     

Interior-point algorithm based on general kernel function for monotone linear complementarity problem

A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on:a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.     

Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming

In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming (LP) problems. The algorithms are based on a few kernel functions, including both self-regular functions and non-self-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynamic step size are more efficient than those with fixed step size. Project supported by Dutch Organization for Scientific Research (Grant No.613.000.010)     

基于哈希函数的查找算法设计及性能分析

查找是计算机程序设计中重要的操作,查找的效率一直是算法分析与设计领域关注的问题之一。在简要讨论传统的顺序查找和折半查找算法的基础上,提出一种基于哈希函数的查找算法。其方法综合了数字分析法和折叠法的特点。本文以图书信息查找为例,设计了查找算法并完成了性能分析。     

一种求解多峰函数优化问题的全局与局部搜索相结合的演化算法

搜索多极值点问题是遗传算法研究领域内的一个新的方向，本在郭涛算法^[1]的基础上引入梯度算子、单亲繁殖、小生境分离和全局与局部演化相结合的混合演化算法．实例测试表明，该算法能够快速求出多峰函数的所有全局最优解，得到令人满意的结果．     

Optimization of membership function for fuzzy control based on genetic algorithm and its applications

ｙ Ｃｏｎｔｒｏｌ Ｂａｓｅｄ ｏｎ Ｇｅｎｅｔｉｃ Ａｌｇｏｒｉｔｈｍ ａｎｄ Ｉｔｓ ＡｐｐｌｉｃａｔｉｏｎｓTX１ＩｎｔｒｏｄｕｃｔｉｏｎＭｅｍｂｅｒｓｈｉｐｆｕｎｃｔｉｏｎｉｓｔｈｅｂａｓｉｓｆｏｒｆｕｚｚｙｌｏｇｉｃｔｈｅｏｒｙｔｏａｐｐｌｉ...     

一类4元分圆序列的线性复杂度稳定性研究

对F4上一类具有高非线性度的4元分圆序列的稳定性进行了深入研究.给出了该序列的1-错线性复杂度的一个上界,研究结果表明该序列不具有稳定的线性复杂度性质.     

基于德国功能派翻译理论的机械类英语资料的汉译研究

本文以德国功能派翻译理论为理论基础,根据机械类英语资料的词汇、语法及语篇特征及其翻译标准,提出此类资料的汉译常用的翻译方法及策略,如增词及省词法、转译法、分译法等,并通过实例验证了以功能派翻译理论作为理论指导的翻译行为的合理性和可行性。     

一种基于评价函数的三维矩形布局遗传算法

针对三维矩形布局问题,提出一种基于评价函数的布局遗传算法.该算法根据布局已知条件建立定序和定位评价函数,然后通过对评价函数值的比较确定布局的定序和定位规则;最后采用遗传算法优化定序和定位规则的参数.算例测试结果表明,该算法具有良好的计算效果.     

基于粒子群优化算法的散乱数据光顺拟合

在散乱数据光顺拟合问题的计算中,引入了群体智能粒子群优化算法,增加了计算的自动程度以及客观性,优化中提出了优于传统罚函数法的模糊罚函数法,将模糊集合理论和粒子群优化算法有机地结合起来,并通过对节点序列内在关联性的分析,提出了适合邻域搜索类算法实施的邻域结构,以获得目标函数的全局解,最后给出了数值仿真实例。     

基于遗传机制的蚁群算法求解连续优化问题

A new algorithm is presented by using the ant colony algorithm based on genetic method (ACG) to solve the continuous optimization problem.Each component has a seed set.The seed in the set has the value of component,trail information and fitness.The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed.The genetic method is used to form new solutions from the solutions got by the ants.Best solutions are selected to update the seeds in the sets and trail information of the seeds.In updating the trail information,a diffusion function is used to achieve the diffuseness of trail information.The new algorithm is tested with 8 different benchmark functions.     

Improved blind multiuser detection algorithm based on minimum output energy

Based on minimum output energy,an improved blind multiuser detection algorithm is proposed by the use of Hopfield neural network.Compared with traditional algorithms,the proposed algorithm does not need the circuit for constraints.The resources are greatly saved and the complexity is reduced as well.The simulation results show that the performance of the improved algorithm is similar to that of the optimal multiuser detection algorithm which is not suitable for the mobile station.Compared with the traditional gradient blind multiuser detection algorithm,the convergence speed of the improved algorithm is quickened.     

基于新型自适应遗传算法的直线感应电机的优化设计(英文)

为了提高直线感应电机的力能指标,提出一种新型自适应遗传算法,并对直线感应电机进行了优化设计.采用佳点集理论对遗传算法的初始化种群进行均匀设计,提高了遗传算法的优化效率.同时利用sigmoid函数改进了交叉概率和变异概率,使交叉率和变异率按照个体的适应度在平均适应度和最大适应度之间随sigmoid曲线进行非线性调整.在分析直线感应电机与旋转电机物理结构差异的基础上,得到考虑边端效应的直线感应电机的稳态性能,并给出直线感应电机力能指标的优化模型.通过对优化后的设计方案与原设计方案的比较发现:直线感应电机的力能指标显著提高,验证了方法的有效性.     

基于绕组函数理论的长定子直线同步电机内部故障仿真计算（英文）

为了保证高速磁浮列车系统安全牵引运行,提出一种基于绕组函数理论的新颖模型并用该模型对长定子直线同步电机进行建模,便于实时计算列车的运行状态.首先在正常运行模型的基础上推导长定子直线同步电机在不同故障状态下的精确耦合数学模型,然后对其运行时存在的主要潜在定子绕组内部故障如单相短路、相间短路和单相开路等进行故障电流、电磁力仿真计算.将计算得到的直线电机运行电磁力随定子电流变化的特性曲线与有限元方法的结果进行对比,验证了所提出的电磁力公式的准确性.通过比较在不同故障类型和故障短路比下故障电流、电磁力仿真结果的变化情况,找出了内部故障规律,同时显示了此解析数学模型在电机故障快速识别中具有可用性.     

基于有限元分析的纳米级微进给平台设计

设计了一种利用弹性铰链作为预紧机构、高精度滚动导轨作为导向机构的单PZT驱动的微进给平台。利用有限元方法对微进给平台的结构和静、动态特性进行了研究。在静态特性中着重分析了微进给平台的静态刚度,得出整个动平台的工作平面上的刚度分布图。在动态特性分析中着重研究了微进给平台的模态振型、固有频率和谐波激励响应,得出了激进给平台在动态激振力作用下的特性。最后分析了微进给平台工作平面上静态刚度和动态刚度变化很大的原因,并提出一些改进的措施。     

两自由度闭链机器人的神经网络自适应控制

A closed-chain robot has several advantages over an open-chain robot, such as high mechanical rigidity, high payload, high precision. Accurate trajectory control of a robot is essential in practical use. This paper presents an adaptive proportional integral differential (PID) control algorithm based on radial basis function (RBF) neural network for trajectory tracking of a two-degree-of-freedom (2-DOF) closed-chain robot. In this scheme, an RBF neural network is used to approximate the unknown nonlinear dynamics of the robot, at the same time, the PID parameters can be adjusted online and the high precision can be obtained. Simulation results show that the control algorithm accurately tracks a 2-DOF closed-chain robot trajectories. The results also indicate that the system robustness and tracking performance are superior to the classic PID method.