[Coin-ipopt] Memory Allocation.

[deprince at uchicago.edu]

Hello,

I have been using Ipopt for some time now with much success,
benchmarking my own calculations against existing canned
packages.  My problem has come up recently when the number of
non-zeros in my constraint jacobian hits 1 million.  I first
received errors regarding the size of the workspace for the
ma27 solver:

Number of nonzeros in equality constraint Jacobian...:  1229184
Number of nonzeros in inequality constraint Jacobian.:        0
Number of nonzeros in Lagrangian Hessian.............:        0

MA27BD returned iflag=-4 and requires more memory.
 Increase liw from 12321685 to 123216850 and la from 1234617
to 12377700 and factorize again.
MA27BD returned iflag=-4 and requires more memory.
 Increase liw from 123216850 to 1232168500 and la from
12377700 to 126782410 and factorize again.

EXIT: Not enough memory.

I bypass the first errors using the ma27_liw_init_factor and
ma27_la_init_factor options, but I still recieve EXIT: Not
enough memory.

When I enter the solver, there are about 6.5 gigs of memory
available, so I'm not sure why the program crashes.  Could the
 problem be with the memory allocation for ma27?  I'm not
really familiar with the way FORTRAN allocates memory, so I
don't know if this is the case.  If anyone has any ideas, I
would really appreciate them.

Thanks in advance,
Eugene