Quadratic Programming VI
- 已更新2025-07-30
- 閱讀時間為 1 分鐘
Uses either an interior point algorithm or an active set algorithm to solve the problem: minimize 0.5x*Q*x + c*x, such that A*x=b and Imin are less than or equal to D*x, which is less than or equal to Imax. You must manually select the polymorphic instance to use.
