Speed up fminbnd using vectorization

2017 8 12
3 个回答
回答已采纳
更新时间：2018 5 24
5 次查看（30 天）

0 个投票

I am trying to optimize this piece of code. I am using the function fminbnd on a vector, splitting the task on its single entries using a loop.
Would it be possible to speed it up vectorizing the process?
for i = 1:A
for ii= 1:B
for iii = 1:C
fun = @(x) (x * variable(i,ii,iii))^2 ;
[arg_min(i,ii,iii), min_(i,ii,iii)] = fminbnd(fun,0,2);
end
end
end
Thanks for the attention.
Sincerely
Luca

请先登录，再回答此问题。

 采纳的回答

Matt J
Matt J 2017-8-12

0 个投票

In your example, the solution is always x=0, so a trivial vectorized solution would be
arg_min=zeros(A,B,C);
min_ = arg_min;
More generally, no, vectorization will not help in a situation like this. You could consider parallelizing the loop using PARFOR.

更多回答（2 个）

Luca Gagliardone
Luca Gagliardone 2017-8-16
编辑：Luca Gagliardone 2017-8-16

0 个投票

What if I create a vector x containing all the possible values for minimization:
x = permute(repmat([0:0.01:2]',[1,A,B,C]),[2,3,4,1]);
variable2 = repmat(variable,[1,1,1,length(x)]);
fun = (x .* variable2).^2;
min_ = min(fun,[],4);
That would do an approximation of the above? Thanks.
Luca

类别

在 帮助中心 和 File Exchange 中查找有关 Optimization 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by