[Coin-ipopt] limited-memory quasi-Newton approximation

[Susana Lera]

Hi,

I'm trying to solve the known Goddard sounding rocket problem with Ipopt, but I can't reach to an optimal solution. It stops after 270 iterations saying the problem failed.
I'm using the Mumps solver and I choosed the option limited-memory quasi-Newton approximation to get the Hessian.
Can this let to an unaccurate solution?

Thanks,

Susana Lera