<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">Hi everybody,<div><br></div><div>I have a question concerning Ipopt's strategy for handling unbounded solution sets (see 3.7 in the implementation paper). In Sect. 3.7 it is stated that the objective function of the barrier problem is modified in a way such that divergence of variables with only one bound is penalized. Am I right in assuming that this "heuristic" affects all occurrences of the objective function of the barrier problem and its gradient. In particular, are the additional penalization terms at place in Eq. (18b), (19) and (20) in the filter line-search procedure.</div><div><br></div><div>Thanks in advance,</div><div>Martin Schmidt</div><div><br><div>
<span class="Apple-style-span" style="border-collapse: separate; color: rgb(0, 0, 0); font-family: Helvetica; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-align: -webkit-auto; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; -webkit-text-decorations-in-effect: none; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px; font-size: medium; "><span class="Apple-style-span" style="border-collapse: separate; color: rgb(0, 0, 0); font-family: Helvetica; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-align: -webkit-auto; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; -webkit-text-decorations-in-effect: none; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px; font-size: medium; "><div style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><div>---</div><div>Dipl.-Math. Martin Schmidt</div><div>AG Algorithmische Optimierung</div><div>Institut für Angewandte Mathematik</div><div>Leibniz Universität Hannover</div><div>Welfengarten 1, 30167 Hannover</div><div>Tel.: 0511-7623873</div><div>E-Mail: <a href="mailto:mschmidt@ifam.uni-hannover.de">mschmidt@ifam.uni-hannover.de</a></div><div>Web: <a href="http://www.ifam.uni-hannover.de/~mschmidt/">http://www.ifam.uni-hannover.de/~mschmidt/</a></div></div></span></span>
</div>
<br></div></body></html>