On a class of quadratic programming problem with equality constraints 一類帶有等式約束的二次規(guī)劃問題
Fixed iterative method for solving the inequality constrained quadratic programming problem 不等式約束二次規(guī)劃的不動點迭代
An interior point algorithm for convex quadratic programming problem with box constraints 框式約束凸二次規(guī)劃問題的內(nèi)點算法
A global convergence inner - point style algorithm for generic quadratic programming problem 二次規(guī)劃問題的一個全局收斂的內(nèi)點型算法
Training svm can be formulated into a quadratic programming problem . for large learning tasks with many training examples , off - the - shelf optimization techniques quickly become intractable in their memory and time requirements . thus , many efficient techniques have been developed 訓練svm的本質(zhì)是解決一個二次規(guī)劃問題,在實際應用中,如果用于訓練的樣本數(shù)很大,標準的二次型優(yōu)化技術就很難應用。