针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
建立非线性等式和不等式约束规划问题的一个序列二次规划(sqp)型算法。
An algorithm of successive quadratic programming (SQP) type is presented to program problems with nonlinear equality and inequality constraints.
本文给出了最大割问题的二次规划算法。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
所运用的线性不等式组的一种旋转算法避免了通常处理二次规划问题所需的松弛变量、剩余变量和人工变量，操作简便、计算效率高。
The algorithm solves the quadric programming problem without adding slack, remaining and artificial variables while its efficiency is very high and it operates very easily.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
研究了价格控制问题-非线性二次双级规划，针对其解集的基本性质，提出了求解价格控制问题的基础算法。
The price control problem-nonlinear quadratic bilevel programming is studied. Based on the properties of its solution set, the fundamental algorithm is proposed.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
对于大规模的具有伪凸目标函数的二次规划问题，本文提出一种分解算法。
This paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
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.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
文中以二次规划算法解决了电力市场环境下考虑爬坡约束的短期发电计划的制定问题。
The quadratic programming method is used to solve the short-term power generation scheduling problem under the condition of electricity market and considering the ramp constraints of generating sets.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
该算法能针对在样本有限的情况下，采用结构风险最小化准则，把学习问题转化为一个二次规划问题来获得最优解。
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.
利用这些敏度公式就可以构造出有效的序列二次规划算法来求解涉及重特征值的最优结构设计问题。
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.
在第二章，我们提出了一种解决具有原方块角形结构正定二次规划问题的分解协调算法。
In chapter 2, we presented a method for solving positive definite quadratic programming with coupled-block structure.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
利用直接打靶法，将此最优控制模型转化为非线性规划问题，并采用序列二次规划算法进行解算。
By using direct shooting method, the associated optimization was converted into a nonlinear programming problem, which was solved through a sequential quadratic programming solver.
利用直接打靶法，将此最优控制模型转化为非线性规划问题，并采用序列二次规划算法进行解算。
By using direct shooting method, the associated optimization was converted into a nonlinear programming problem, which was solved through a sequential quadratic programming solver.
应用推荐