对于大规模的具有伪凸目标函数的二次规划问题，本文提出一种分解算法。
This paper proposes a decomposition algorithm for large scale quadratic programming with a pseudoconvex objective function.
该模型通过引入权系数，使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
本文在matlab优化工具箱的基础上编写了实现序列二次规划法的程序来求解无功优化问题。
In this paper, a program based on MATLAB optimization toolbox implements SQP method to solve RPO 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 quadratic programming algorithm is presented to solve Max-cut problem.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
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.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
考虑了广义二次规划问题，基于其鞍点的充要条件，提出了求解它的一个神经网络。
This paper considers the extended quadratic programming problem. Based on the necessary and sufficient conditions for a saddle point, a neural network for solving it is proposed.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
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.
滚动时域估计的基本策略就是将状态估计问题化为一个二次规划问题。
The basic strategy of MHE is to reformulate the estimation problem asa quadratic program using a moving estimation window.
根据混合逻辑动态系统的标准形式，转化为混合整数二次规划(MIQP)的问题，同时获得它的数学描述。
According to the standard form of MID system, the problem of mixed integer quadratic programming (MIQP) and its mathematics description can be obtained.
本文提出了一种求解二进制二次规划问题的连续化方法。
A continuous approach to solving general binary quadratic problems is investigated.
研究了价格控制问题-非线性二次双级规划，针对其解集的基本性质，提出了求解价格控制问题的基础算法。
The price control problem-nonlinear quadratic bilevel programming is studied. Based on the properties of its solution set, the fundamental algorithm is proposed.
建立了道路识别问题的数学模型并将上述问题与一个不等式约束的正定二次规划问题相联系。
A mathematic model of road identification problem is provided and the problem is related with a positive definite quadratic programming problem with inequality constraints.
所运用的线性不等式组的一种旋转算法避免了通常处理二次规划问题所需的松弛变量、剩余变量和人工变量，操作简便、计算效率高。
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.
基于多用户检测问题的二次整数规划模型，提出了一种带预处理的半定规划多用户检测方法。
Based on the quadratic integral programming model of the multiuser detection problem, a detection strategy by the semidefinite programming method with pretreatment is presented.
这些新的结论都表明了该神经网络在求解有界约束二次规划问题时的有效性。
All these new results show the validity of the network in solving quadratic optimization with bound constraints.
现有的大多数分类问题都能转化成一个正定二次规划问题的求解。
Most existed classification problems can be converted into a positive definite quadratic program.
文中以二次规划算法解决了电力市场环境下考虑爬坡约束的短期发电计划的制定问题。
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.
把高维线性互补问题转化为与之等价的高维二次规划问题，然后把高维二次规划问题分解为一系列低维二次规划问题。
The higher dimensional linear complementary problem is transformed into quadratic (programming), and then decomposed into a series of lower dimensional quadratic programming.
本文利用统计学中线性模型的理论给出一类等式约束二次规划问题解的表达式。
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.
该算法能针对在样本有限的情况下，采用结构风险最小化准则，把学习问题转化为一个二次规划问题来获得最优解。
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.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
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.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
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.
应用推荐