本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
建立了道路识别问题的数学模型并将上述问题与一个不等式约束的正定二次规划问题相联系。
A mathematic model of road identification problem is provided and the problem is related with a positive definite quadratic programming problem with inequality constraints.
这些新的结论都表明了该神经网络在求解有界约束二次规划问题时的有效性。
All these new results show the validity of the network in solving quadratic optimization with bound constraints.
本文利用统计学中线性模型的理论给出一类等式约束二次规划问题解的表达式。
In this paper, using the theories of linear model in the statistics, we can give the general expression on solution of a class of equality constrained quadratic programs problem.
建立非线性等式和不等式约束规划问题的一个序列二次规划(sqp)型算法。
An algorithm of successive quadratic programming (SQP) type is presented to program problems with nonlinear equality and inequality constraints.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
首次将二次稳定性问题等价地转化为约束非线性规划问题。
The problem is firstly transformed into an equivalent constraint nonlinear programming problem.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex 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.
该模型通过引入权系数，使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
由于线性二层规划、二层二次规划的约束条件全部是线性函数，而单纯形方法是目前解决线性规划的最有力的工具。
Because the constraints of the LBP and BQP are linear functions, and the simple method is the most efficient method to solve linear programming.
文中以二次规划算法解决了电力市场环境下考虑爬坡约束的短期发电计划的制定问题。
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.
然而，支持向量机的训练过程等价于求解一个约束凸二次规划。
However, the training procedure of support vector machines amounts to solving a constrained quadratic programming.
基于最优d . C。分解的单二次约束非凸二次规划精确算法。
An Optimal D. C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint.
在第三章，我们提出了一种解决具有边界约束的正定二次规划问题的对偶方法。
In chapter 3, we presented a dual method for solving positive definite quadratic programming with box constraints.
在第三章，我们提出了一种解决具有边界约束的正定二次规划问题的对偶方法。
In chapter 3, we presented a dual method for solving positive definite quadratic programming with box constraints.
应用推荐