搜索资源列表
Optimiser
- 实现QP优化算法的C++程序,有MATLAB接口。
QP-asm
- 具有等式约束和不等式约束的二次规划问题,的积极集方法(有效集方法)-the active set methods for QP with equality and ineqality constrain
SQP方法
- 序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一,传统的SQP算法每一步迭代都要求解QP子问题。 (Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration
qp
- 实现二次规划,分别给出了等式约束的二次规划和一般的二次规划,还有示例程序(In order to realize the quadratic programming, the quadratic programming with equality constraints and the general quadratic programming are given respectively, as well as the example program)