From: "Marcus M. Edvall" <medvREMall@tomREMopt.cREMom>
Path: news.mathworks.com!newsfeed-00.mathworks.com!webcrossing
Newsgroups: comp.soft-sys.matlab
Subject: Re: Fmincon + Ansys, Looking for a global minimum
Message-ID: <ef473bb.11@webcrossing.raydaftYaTP>
Date: Wed, 13 Dec 2006 01:02:23 -0500
References: <1164921803.302933.143550@80g2000cwy.googlegroups.com> <el4205$7h4$1@fred.mathworks.com> <1165939328.273924.306090@73g2000cwn.googlegroups.com> <ef473bb.9@webcrossing.raydaftYaTP> <1165949772.610999.138850@f1g2000cwa.googlegroups.com>
Lines: 32
NNTP-Posting-Host: 69.105.136.213
MIME-Version: 1.0
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
Xref: news.mathworks.com comp.soft-sys.matlab:383531



Hello,

For costly problems you should use rbfSolve or EGO:
 <http://tomopt.com/tomlab/products/cgo/>

glcCluster might perform well for these cases as well. You can easily
limit the number of clusters that are used for local optimization
(with snopt, npsol or knitro).

Prob.GO.maxLocalTry = 3; for example.

You might also find LGO or OQNLP suitable.

Observe, you only need to setup the problem once, then it just a
matter of printing the results and analyze for all options. A few
parameters to tweak here and there.

You can use it for free over 3-4 weeks.

Best wishes, Marcus
 <http://tomopt.com/tomlab/>

 strefli3 wrote:
>
>
> Unfortunatly I do not have a sponsorship with TOMLAB, thus I did
> not
> persue that possibility.
>
> However, now that we are on the topic, how will glcCluster perform
> when
> my function is very costly?