Re: Wish to avoid multiple for loops, but don't know how to do it

[Jordi Gutiérrez Hermoso]

On 19 May 2011 12:43, clustro <address@hidden> wrote:
> for i = 1:N
>        for j = 1:N
>                for k = 1:N
>                        for l = 1:N
>                                xPoint = [x(i) x(j) x(k) x(l)]';
>                                fEval_x = colville(xPoint);
>                                if fEval_x < fmin
>                                        fmin = fEval_x;
>                                        xmin = xPoint;
>                                endif
>                        endfor
>                endfor
>        endfor
> endfor
>
> Where colville() is an optimization toy function.
>
> Does anyone have a suggestion on how to avoid 20 nested for loops when
> trying to scale this algorithm up to higher dimensions?

I don't understand the full extent of your problem, you basically want
the minimum over the n-fold tensor product of a vector?

You might be able to do this with arrayfun, although I don't
immediately see how to avoid the actual tensoring.

- Jordi G. H.