[Ipopt] IPOPT Binary Status and linear solver choices.

Damien Hocking damien at khubla.com
Sun Feb 22 16:59:43 EST 2009


I'm late to this discussion, I'm on vacation.  Correct me if I'm wrong, but do you want a lib of IPOPT and a MUMPS lib, that's ready to be linked to a BLAS/LAPACK lib, built on Windows?


From: Jesse Perla [mailto:jesseperla at gmail.com]
To: Ruhollah Tavakoli [mailto:rohtav at gmail.com]
Cc: COIN-IPOPT Mailing List [mailto:ipopt at list.coin-or.org]
Sent: Fri, 20 Feb 2009 09:55:11 -0700
Subject: Re: [Ipopt] IPOPT Binary Status and linear solver choices.

Thanks Ruhollah,
I will go through this in detail and have asked MinGW guys for help.  One 
in which peoples compile OpenFoam for native windows application (just know that compiling OpenFoam is in deed very difficult and tedious to in windows platform even by cygwin, so you can imagin their skill). I had already contact with them, they are kind and feedback you.      

I will go through this in detail and have asked MinGW guys for help.  One of the reasons I am bothering you guys here is that I am desperate, and also if I can get these working then I can contribute the makefiles back, so wanted to do it in the way you guys want.
PS: what is structure of your problem, you may use more simpler, compact (and probably efficient) nonlinear programming solver. Based on your speech (difficulty of derivative computation, noise, ...) i guess you do not have nonlinear constraints, probably just have box ones. I think power of IPOPT is more related to excellent treatment of nonlinear constraints. Also what is size of your problem? for small problems SQP type methods may works better, look at software by Prof. Klaus Schittkowski: http://www.math.uni-bayreuth.de/~kschittkowski/software.htm, his codes are available upon request ...  


I realize it is confusing... In economics we tend to have a bunch of nested optimizations.  The top ones are tweaking parameters in expensive derivative free operations, using MLE or GMM, etc.  and the inner ones are solving discrete dynamic programming problems which can become massive depending on the state space. I have a bunch of papers and models I need to write/program, so I am collecting library functions I will need for all of them at once.  I will check out this SQP, but it may not work for some of the problems because we need lots of curvature.  Also, several of the discrete dynamic programming problems I am solving involve mixed-integer so I will need to get BonMin or something similar up and running as well.  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/ipopt/attachments/20090222/a52c8bf3/attachment.html 

More information about the Ipopt mailing list