[Ipopt] Why ipopt needs so many iterations when starting from the optimal solution?

[Ipopt User]

You use 'hessian_approximation','limited-memory', which means at the start
it has no idea about the Hessian. Moreover, you probably do not set the
values of the dual variables. Only if IPOPT knows the Hessian and both
primal and dual values, it can take the most sensible steps towards the
optimal solution.

On Sat, Jun 27, 2015 at 12:13 PM, Gianpaolo Gulletta <
gianpaologulletta at gmail.com> wrote:

> Hi everybody,
>
>
>
> I realized that the performance of the algorithm Ipopt decreases when it
> starts either from the optimal solution or from very closely.
>
> I saw that the problem has already been addressed here
> <https://www.or-exchange.org/questions/1268/why-ipopt-needs-so-many-iterations-when-starting-from-the-optimal-solution>
> but I am still looking for the answer.
>
>
>
> Can anyone help?
>
>
>
> Thank you.
>
>
>
> Regards,
>
>
>
> Gianpaolo Gulletta
>
>
>
> _______________________________________________
> Ipopt mailing list
> Ipopt at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/ipopt
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/ipopt/attachments/20150628/0e13d068/attachment.html>