建立非线性等式和不等式约束规划问题的一个序列二次规划(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.
在本文中,我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
应用推荐