[Coin-ipopt] Non-convex continuous optimization problems

[Pratim Vakish]

Hello,I am solving non-convex continuous optimization problems using IPOPT.I have had the following messages, and have the following questions:1) EXIT: Restoration Failed!What deos it mean? What is the reason?2) EXIT: Maximal number of iterations reached: what is the default\ maximal number of iterations?3) Optimal solution found:How do you determine that the optimal solution has been found when theproblem is non-convex? What is the procedure/method used by IPOPT toeach this conclusion?
P.V.
_________________________________________________________________
Discover the new Windows Vista
http://search.msn.com/results.aspx?q=windows+vista&mkt=en-US&form=QBRE
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/ipopt/attachments/20070308/a4515465/attachment.html