To improve calculation speed , a conventionali optimal method - successive quadratic programming is combined with ga to compose a hybrid ga which can greatly decrease calculation time and improving the precision of optimal solution 对实际系统的计算表明,本文提出的改进遗传算法在计算速度和最优解的质量上均获得了较大的提高。
For the purpose of discovering the near - globally optimal solution , this paper proposed a hybrid approach of ant colony algorithm and sequential quadratic programming ( sqp ) 摘要为了获得整体近似最优解,提出采用蚁群算法,搜索发电机可运行状态的最优组合,并对蚁群算法的数学模型进行分析,以参数的形式给出具有普遍意义的收敛性定理。
Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed 文摘:给出了无界域上不定二次规划的一个算法,该算法将不定二次规划转化为一系列凸二次规划,并证明了算法的收敛性
A full variable quadratic programming model is established for reactive power optimization problem . and a new methodology algorithm based on primal - dual ipm is deduced for such a non - standard quadratic programming model 建立了无功优化问题的全变量的二次规划数学模型,基于原一对偶内点法推导了这一具有非标准形式的二次规划模型的求解过程。
The paper discussed a method combining integer programming based on similarity coefficient with quadratic programming considering ratio of capacity to loading in workshop to obtain parts families and machines groups in two steps 摘要采用了基于相似系数的整数规划和考虑车间资源负荷分配比率的二次规划相结合的方法,分两步得到了零件族和设备组。
The work including : ( 1 ) optimization theory and the essence of svm training method the essence of svm training method is to solve quadratic programming ( qp ) , and it belongs to the area of optimazation theory 本文工作包括: ( 1 )最优化理论的学习以及训练算法的本质svm训练的本质是解决一个二次规划( quadraticprogramming ,简称qp )问题,这是最优化理论的范畴。
Training svm can be formulated into a quadratic programming problem . for large learning tasks with many training examples , off - the - shelf optimization techniques quickly become intractable in their memory and time requirements . thus , many efficient techniques have been developed 训练svm的本质是解决一个二次规划问题,在实际应用中,如果用于训练的样本数很大,标准的二次型优化技术就很难应用。
In order to improve the efficiency of the algorithm , we not only correct some defects of the primal - dual interior point algorithm in [ 4 ] , but also give a modified primal - dual interior point algorithm for convex quadratic programming problem with box constraints 为提高算法的有效性,对文[ 4 ]所给的原始-对偶内点算法理论上的某些缺陷加以更正,并给出框式约束凸二次规划问题的一个修正原始-对偶内点算法。
A program of shape optimization for two - dimensional continuum structures , which is carried out on msc . patran & nastran panel , is described in this thesis , according to a two - phase control theory presented by professor sui yunkang , the optimization is treated as a sequential quadratic programming problem 本文根据隋允康教授提出的二级控制理论,将二维连续体结构的形状优化问题处理成序列二次规划问题进行了优化。
The methods employs solving convex quadratic programming directly or solving convex quadratic programming after converting the large - scale problem into many sub - problem or utilizing sophisticated optimization techniques after converting the constrained optimization problem into unconstrained ones 这些方法是通过求解凸二次规划问题或将大规模问题转化成若干子问题再求解凸二次规划问题,或者是转化为无约束最优化问题再利用比较成熟的最优化方法求解。
Quadratic programming (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.