Path: news.mathworks.com!newsfeed-00.mathworks.com!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: Scott Seidman <namdiesttocs@mindspring.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Find Minimum
Date: 11 Feb 2008 21:10:43 GMT
Organization: Your Company
Lines: 21
Message-ID: <Xns9A41A493EF475scottseidmanmindspri@130.133.1.4>
References: <ac460e51-a1a5-4e93-9031-220be5a23e5a@f10g2000hsf.googlegroups.com> <Xns9A419793662B6scottseidmanmindspri@130.133.1.4> <foqah7$fds$1@canopus.cc.umanitoba.ca> <Xns9A419D4C96F57scottseidmanmindspri@130.133.1.4> <foqcnc$i3l$1@canopus.cc.umanitoba.ca>
X-Trace: individual.net 8D7Y5cdXamVeeSzAZvn9AQEV+S1wbBKYAcIJGuBoLC1y+vmjo=
Cancel-Lock: sha1:U8+kyOJBH86bmb3k69ti3xpcZBI=
User-Agent: Xnews/5.04.25
Xref: news.mathworks.com comp.soft-sys.matlab:450663


roberson@ibd.nrc-cnrc.gc.ca (Walter Roberson) wrote in news:foqcnc$i3l$1
@canopus.cc.umanitoba.ca:

> Even if you had an algorithm that (for example) after five
> function evaluations was able to predict a parameter combination that
> was unsurpassed in another billion explorations of the parameter
> space, then because of the black-box nature of the function,

This is getting a little circular.  To know any function as well as you 
seem to assert you need to know it to do an optimization, it would seem 
that you need to know the function value at every possible value of 
parameter space.

Obviously, this must be a misunderstanding on my part, but it does be the 
question of hat, exactly, are your requirements for a solvable 
optimization?


-- 
Scott
Reverse name to reply