- Since matrices used here are huge, if all the variables are pre-loaded into the MATLAB Workspace before calling the function “quadprog”, then it will reduce the execution time of the script.
- Providing a good initial starting point i.e., “x0”, the function “quadprog” will converge quickly as it is based on iterative interior-point algorithm.
- You can use “mpcActiveSetSolver” function alternatively which is available in MPC toolbox. The condition here is that matrix “H” must be positive definite matrix.
quadprog runs very slow on large problem involving l^1 norm
6 次查看(过去 30 天)
显示 更早的评论
Hi,
I want to find the minimum of the function with respect to vector x on matlab R2020b:
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/474033/image.png)
f = [- A'*y - B'*z; lambda * ones(s_length,1)];
H = blkdiag(A'*A + B'*B,zeros(s_length));
A = [eye(s_length) -eye(s_length);
-eye(s_length) -eye(s_length)];
b = zeros(2*s_length,1);
Aeq = [];
beq = [];
lb = [];
ub = [];
x0 = [];
xopt = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0);
But it turns out quadprog would spend several minutes to give an answer to this problem. Is there a more efficient way to solve this optimization problem? Thanks!
0 个评论
回答(1 个)
Manas Shukla
2022-2-2
As per my understanding of the issue, it takes several minutes to execute the whole script which includes loading variables into MATLAB Workspace, the time it takes for matrix multiplication while defining variable “f”, and lastly amount of time to process the function “quadprog”. Here are few suggestions to overcome your issue:
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Quadratic Programming and Cone Programming 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!