Path: news.mathworks.com!not-for-mail
From: "Jun Li" <twofishleft@gmail.com>
Newsgroups: comp.soft-sys.matlab
Subject: fmincon complexity
Date: Fri, 16 May 2008 09:56:02 +0000 (UTC)
Organization: ist
Lines: 14
Message-ID: <g0jlni$idj$1@fred.mathworks.com>
Reply-To: "Jun Li" <twofishleft@gmail.com>
NNTP-Posting-Host: webapp-03-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1210931762 18867 172.30.248.38 (16 May 2008 09:56:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Fri, 16 May 2008 09:56:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1373919
Xref: news.mathworks.com comp.soft-sys.matlab:468792


hi, all:

i am using the fmincon to solve problems.

like: f = log det(Q)
Q is  n- square,
and it has n equality constraints, 
n*m inequality constraints.

what is the complexity of the algorithm?

thanks

Jun