二次规划(QP)为NP完全问题。
这是第二次规划海马股价下跌的价格。
This is the second time planning hippocampus shares down to price.
本文给出了最大割问题的二次规划算法。
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.
介绍了一种无功优化模型，并基于连续二次规划的方法。
This paper presents a reactive power optimization model that is based on successive quadratic programming methods.
本文提出了一种求解二进制二次规划问题的连续化方法。
A continuous approach to solving general binary quadratic problems is investigated.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
把这种算法应用于二次规划，得到了二次规划的一种新的迭代法。
A new iterative algorithm for quadratic programming is obtained when applying the general algorithm to quadratic programming.
本文给出了半无限二次规划和它的对偶规划之间没有间隙的条件。
The conditions under which there is no duality gap between the semi-infinite quadratic programming and its dual programming are given.
现有的大多数分类问题都能转化成一个正定二次规划问题的求解。
Most existed classification problems can be converted into a positive definite quadratic program.
基于最优d . C。分解的单二次约束非凸二次规划精确算法。
An Optimal D. C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint.
滚动时域估计的基本策略就是将状态估计问题化为一个二次规划问题。
The basic strategy of MHE is to reformulate the estimation problem asa quadratic program using a moving estimation window.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
这些新的结论都表明了该神经网络在求解有界约束二次规划问题时的有效性。
All these new results show the validity of the network in solving quadratic optimization with bound constraints.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
混合逆数值算法是一种两步算法，包含直接矩阵反演求逆和二次规划两个步骤。
The Hybrid Inverse numerical method is a two-step numerical method, comprising of direct matrix inversion and quadratic programming.
建立非线性等式和不等式约束规划问题的一个序列二次规划(sqp)型算法。
An algorithm of successive quadratic programming (SQP) type is presented to program problems with nonlinear equality and inequality constraints.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
推导了带约束的预测模型，并将约束广义预测控制的求解化为典型的约束二次规划。
The predictive model is derived and the solution of a generalized predictive controller with restrictions is changed into a constrained quadratic programming problem.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed. The convergence of the algorithm is discussed.
混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
文中以二次规划算法解决了电力市场环境下考虑爬坡约束的短期发电计划的制定问题。
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.
采用基于二次规划的准解析法理论，建立了结构分析和结构优化系统（SAAOP）。
The system (SAAOP) of structure analysis and optimization based on dual method has been set up.
该模型通过引入权系数，使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
在简要介绍MATLAB优化工具箱中的序列二次规划法后，采用该算法求出设计结果。
The sequential quadratic programming algorithm of optimization toolbox of MATLAB is effectively used to solve the model after it is concisely introd.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
建立了道路识别问题的数学模型并将上述问题与一个不等式约束的正定二次规划问题相联系。
A mathematic model of road identification problem is provided and the problem is related with a positive definite quadratic programming problem with inequality constraints.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
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.
试验验证表明，用二次规划求解的强迫转角法是进行钢筋混凝土连续梁弹塑性分析的有效方法。
Some experiments show that the "imposed rotation method" derived from quadratic programming is a useful method in elastoplastic analysis of reinforced concrete continuous beams.
应用推荐