Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
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 objective functions are obtained by use of the sequential quadratic programming.
对建立的计算模型采用序列二次规划法进行优化求解。
One method of solving the problem of sphere-constrained convex quadratic programming;
介绍一种求解高维凸二次规划的可行方向法。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
A region decomposition method to solve a positive definite quadratic programming is presented.
给出了一个求解正定二次规划的区域分解方法。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
The optimum design program is developed based on series quadratic programming (SQP) optimum method.
根据序列二次规划(SQP)优化方法，编写了优化设计程序。
Presents a method to solve quadratic programming problems with advantages of quickness and accuracy.
提出一种求解二次规划问题的方法。这种方法可快速、准确地得到问题的解。
The sequential quadratic programming was utilized to avoid the complex calculation in sensitivity analysis.
为了提高计算效率，本文采用序列二次规划法避免了灵敏度分析中的复杂计算。
This paper presents a reactive power optimization model that is based on successive quadratic programming methods.
介绍了一种无功优化模型，并基于连续二次规划的方法。
However, the training procedure of support vector machines amounts to solving a constrained quadratic programming.
然而，支持向量机的训练过程等价于求解一个约束凸二次规划。
In chapter 3, we presented a dual method for solving positive definite quadratic programming with box constraints.
在第三章，我们提出了一种解决具有边界约束的正定二次规划问题的对偶方法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
This paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
对于大规模的具有伪凸目标函数的二次规划问题，本文提出一种分解算法。
A new iterative algorithm for quadratic programming is obtained when applying the general algorithm to quadratic programming.
把这种算法应用于二次规划，得到了二次规划的一种新的迭代法。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
Based on the sequential quadratic programming method, a thrust allocation for the trailing suction hopper dredger was presented.
以序列二次规划法为理论基础，提出一种针对耙吸式挖泥船的推力分配方案。
The Hybrid Inverse numerical method is a two-step numerical method, comprising of direct matrix inversion and quadratic programming.
混合逆数值算法是一种两步算法，包含直接矩阵反演求逆和二次规划两个步骤。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
The conditions under which there is no duality gap between the semi-infinite quadratic programming and its dual programming are given.
本文给出了半无限二次规划和它的对偶规划之间没有间隙的条件。
An algorithm of successive quadratic programming (SQP) type is presented to program problems with nonlinear equality and inequality constraints.
建立非线性等式和不等式约束规划问题的一个序列二次规划(sqp)型算法。
The paper deals with the contact strength problem of tractive mechanism of shearer by the finite element parametric quadratic programming method.
本文应用有限元参数二次规划法求解采煤机牵引行走机构齿轨接触强度问题，介绍了有限元建模和网格划分，分析了计算结果。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
The key problem of training support vector machines is how to solve quadratic programming problem, but for large training examples, the problem is too difficult.
训练支持向量机的本质问题就是求解二次规划问题，但对大规模的训练样本来说，求解二次规划问题困难很大。
A primal-dual neural network(PDNN)based on linear variational inequalities(LVIs)is introduced as the real-time solver for the resultant quadratic programming scheme.
提出了基于线性变分不等式的原对偶神经网络，并将其作为所对应的二次型规划方案的实时求解器。
The predictive model is derived and the solution of a generalized predictive controller with restrictions is changed into a constrained quadratic programming problem.
推导了带约束的预测模型，并将约束广义预测控制的求解化为典型的约束二次规划。
The predictive model is derived and the solution of a generalized predictive controller with restrictions is changed into a constrained quadratic programming problem.
推导了带约束的预测模型，并将约束广义预测控制的求解化为典型的约束二次规划。
应用推荐