<div dir="ltr">Your dual infeasibility is off the charts. Something is really off. It would help if you describe your problem more, or give a similar problem.<br></div><br><div class="gmail_quote">On Tue, Mar 10, 2015 at 8:05 PM Miguel Angel Salazar de Troya <<a href="mailto:salazardetroya@gmail.com">salazardetroya@gmail.com</a>> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Hi<div><br></div><div>I'm trying to optimize an unconstrained problem with a penalty function. My goal is to obtain either 0 or 1 for the variables and the penalty term takes care of this. </div><div><br></div><div>The optimization eventually converges, but at the beginning, for each iteration, the objective function is evaluated many times, over 50 times. For each iteration, I obtain an output like this:</div><div><br></div><div>iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls<br></div><div><div> 5 1.4656145e+04 0.00e+00 1.29e+53 -0.1 8.80e+92 -5.4 8.88e-95 2.08e-148f172 FqsWSWs</div><div><br></div><div>Any idea of what's going on and how I could make it converge faster?</div><div><br></div><div>Thanks in advance</div><div>Miguel</div><div><br></div>-- <br><div><div dir="ltr"><font face="verdana, sans-serif"><b>Miguel Angel Salazar de Troya</b></font><span><font color="#888888"><br><font face="arial,helvetica,sans-serif">Graduate Research Assistant<br>Department of Mechanical Science and Engineering<br></font>University of Illinois at Urbana-Champaign<br>(217) 550-2360<br>
<a href="mailto:salaza11@illinois.edu" target="_blank">salaza11@illinois.edu</a></font></span><div><br></div></div></div>
</div></div>
______________________________<u></u>_________________<br>
Ipopt mailing list<br>
<a href="mailto:Ipopt@list.coin-or.org" target="_blank">Ipopt@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/ipopt" target="_blank">http://list.coin-or.org/<u></u>mailman/listinfo/ipopt</a><br>
</blockquote></div>