资 源 简 介
求解序列二次规划程序,只要编写不同的目标函数,目标函数导数,约束函数,约束函数的雅克比矩阵,即可求出不同问题的最大值或最小值。Solving sequence quadratic programming, as long as write a different objective function, the target function and constraint function, constraint function of Jacobi matrix, then find out the maximum or minimum of a different question.