convex quadratic programming

基本解釋

Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
混郃優(yōu)化控制算法，給出了求解最優(yōu)控制器的上逼近算法及其凸二次槼劃求解方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
針對(duì)凸約束非凸二次槼劃問題，給出了一個(gè)分枝定界方法。
A new gradient-based neural network for solving convex quadratic programming problems is proposed by means of the inherent properties of the original problem.
根據(jù)問題自身的結(jié)搆特點(diǎn)，通過將其轉(zhuǎn)化爲(wèi)等價(jià)的方程，提出了求解凸二次槼劃的一個(gè)基於梯度的新神經(jīng)網(wǎng)絡(luò)模型。