通过二次型最优控制LQR算法，根据极值原理导出最优控制律，以确定半主动减振器驱动器控制力。
By using quadric LQR algorithm, optimal control rule was educed. According to extremum principle, control force of driver on semi-active damper was confirmed.
然后根据两个双层规划的最优解和最优目标值之间的关系，提出一种简单有效的算法来解决非增值型凸二次双层规划间题。
And then a simple effective algorithm for the VQBP is proposed based on the relationship between the optimal solutions of the two value-type bilevel programming problems.
对求解CTDM的部分线性化算法进行分析，提出了在进行步长优化时使用二次插值法得到模拟最优步长的方法。
By analyzing the partial linearization algorithm of CTDM, a quadratic interpolation method is proposed to obtain the approximated optimal step size.
而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
But USES based on the breadth first algorithm, in only considered one to two time trades while the actual situation in, can the effective realization most superior way inquiry.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
并且通过把该交叉规划转化为特殊的凸二次双水平规划，给出这类交叉规划的最优性条件和求解算法。
Furthermore, it gives an optimum condition and a simple algorithm of the special interaction programming by changing it into a special convex quadratic bilevel programming.
本设计针对广泛应用的最优控制理论进行论述，并对其在实践中常用的线性二次型问题的原理和算法详细阐述。
This thesis discusses the first-rank control theory which is applied widely, and we discuss the principle and algorithm of linear-quadratic regulator in details.
解决这类问题的一般方法是采用启发式算法求出最优或次最优约简。
The common method to solve this problem is to adopt the heuristic algorithm.
基于最优d . C。分解的单二次约束非凸二次规划精确算法。
An Optimal D. C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
SVM transforms machine learning to solve an optimization problem, and to solve a convex quadratic programming problem by the optimization theory and method constructing algorithms.
多目标遗传优化算法的一个优点就是可在一次迭代计算中寻找到问题的多个非劣最优解。
One advantage of multi-objective genetic optimization algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run.
改进后的遗传算法通过二次演化能够有效地避免算法中容易陷入局部最优值的缺陷。
Improved Genetic Algorithms can avoid the defect of reaching the part best value easily by the twice evolution.
混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
该算法能针对在样本有限的情况下，采用结构风险最小化准则，把学习问题转化为一个二次规划问题来获得最优解。
The method can transfer the learning problem into a second planning to acquire the optimal solution according to the principle of structure risk minimum under limited samples situation.
DCT变换是一种与KL变换非常相似的次最优变换算法。
Discrete cosine transform (DCT) is a hypo-optimal transform approach similar to KL transform.
根据无约束最优化问题的梯度算法，提出了二次梯度算法，并证明了其收敛性。
In this paper, the gradient computational algorithm about unconditional extreme value is given.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
方法在分析已有栅格边长估算方法的基础上，提出基于有点区域的二次分割算法来估算最优边长。
Methods According to the analysis of estimating methods for edge length of grid, a new algorithm of estimating optimal edge length based on point area is presented using second division.
利用直接打靶法，将此最优控制模型转化为非线性规划问题，并采用序列二次规划算法进行解算。
By using direct shooting method, the associated optimization was converted into a nonlinear programming problem, which was solved through a sequential quadratic programming solver.
对动态频谱接入算法的适应性问题进行了分析，并求得了次用户的最优传输时间长度。
The adaptability of the DSA algorithm was analyzed and the optimal transmission time for the SU was obtained.
仿真结果表明，基于遗传算法的PID控制效果比经验值要好，但基于遗传算法的极点配置方法和线性二次型最优控制方法的控制效果与经验值相比，没有明显的优势。
The simulation results show that the results of PID control based on GA are better than experience, but the results of pole assignment control and LQR control are not clear advantage whit experience.
利用这些敏度公式就可以构造出有效的序列二次规划算法来求解涉及重特征值的最优结构设计问题。
Truncating the characteristic equation up to the different order, we have obtained the first order and the second order sensitivity expressions both for the single and multimodal eigenvalues.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
应用推荐