convex quadratic programming

基本解释

Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
A new gradient-based neural network for solving convex quadratic programming problems is proposed by means of the inherent properties of the original problem.
根据问题自身的结构特点，通过将其转化为等价的方程，提出了求解凸二次规划的一个基于梯度的新神经网络模型。