| 1. | Interior point approach for convex quadratic programming
凸二次规划问题的内点算法 |
| 2. | The error estimation of a rational cubic spline
带有界约束非凸二次规划问题的整体优化方法 |
| 3. | An interval algorithm for quadratic programming
二次规划问题的区间算法 |
| 4. | On a class of quadratic programming problem with equality constraints
一类带有等式约束的二次规划问题 |
| 5. | An interior point algorithm for convex quadratic programming problem with box constraints
框式约束凸二次规划问题的内点算法 |
| 6. | A global convergence inner - point style algorithm for generic quadratic programming problem
二次规划问题的一个全局收敛的内点型算法 |
| 7. | When the hessian is positive definite , the qp subproblem is a strict convex quadratic programming
若qp子问题的hessian阵正定，则它是一个严格凸二次规划问题。 |
| 8. | This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分两部分，第一部分研究求解边界约束非凸二次规划问题的整体最优解的分支定界算法。 |
| 9. | According to the low speed of constringency and high complexity of training methods in large scale training , particle swarm algorithm is brought forward to solve the problem
针对在大规模训练中算法收敛速度慢、复杂程度高等问题，提出用粒子群算法求解其中的二次规划问题的思想。 |
| 10. | 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的本质是解决一个二次规划问题，在实际应用中，如果用于训练的样本数很大，标准的二次型优化技术就很难应用。 |
