From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Optmizaing a vector of 1-D functions
Date: Thu, 8 Apr 2010 18:52:09 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 10
Message-ID: <hpl8ko$1ul$>
References: <hpl336$p7k$> <hpl46p$ffa$> <hpl4ui$s0u$> <hpl5t1$efe$> <hpl73t$5u3$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: 1270752729 2005 (8 Apr 2010 18:52:09 GMT)
NNTP-Posting-Date: Thu, 8 Apr 2010 18:52:09 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: comp.soft-sys.matlab:624778

"Andrey Orlov" <> wrote in message <hpl73t$5u3$>...
> For example, F(x) = (f1(x), f2(x))', f1(x) = x^4 - x^3 + 4, f2(x) = x^8-x^10+x^5+100, (a,b) = (-30,30). I want to avoid using iterations if it's possible.
> For my real computation number of those functions fj(x) equals 400....

  For each of the functions in your vector, the minimization problem is independent of all others.  Just put the whole thing in a for-loop and do each component one at a time.  The overhead involved in the for-loop will ordinarily be minuscule as compared to the minimization time.  There is such a thing as carrying the "vectorization" craze too far!

  Incidentally, if your functions are all polynomials, there are better ways of minimizing them than using something like 'fminbnd'!

Roger Stafford