Most existed classification problems can be converted into a positive definite quadratic program.
现有的大多数分类问题都能转化成一个正定二次规划问题的求解。
The standard SVM requires solving quadratic program that needs considerably longer computational time.
因此标准的SVM方法需要求解二次规划问题,计算量很大。
The basic strategy of MHE is to reformulate the estimation problem asa quadratic program using a moving estimation window.
滚动时域估计的基本策略就是将状态估计问题化为一个二次规划问题。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
应用推荐