Path: news.mathworks.com!not-for-mail
From: "Jun Li" <twofishleft@gmail.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: fmincon complexity
Date: Fri, 16 May 2008 10:27:02 +0000 (UTC)
Organization: ist
Lines: 10
Message-ID: <g0jnhl$6ge$1@fred.mathworks.com>
References: <g0jlni$idj$1@fred.mathworks.com> <g0jmr6$fme$1@fred.mathworks.com>
Reply-To: "Jun Li" <twofishleft@gmail.com>
NNTP-Posting-Host: webapp-02-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1210933622 6670 172.30.248.37 (16 May 2008 10:27:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Fri, 16 May 2008 10:27:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1373919
Xref: news.mathworks.com comp.soft-sys.matlab:468804


thank you so much, John.

m is quite large, around 10,000 or even more.
but the algorithm starts at a feasible solution,

so i think the complexity just depends on n, right?

thanks

Jun