<div dir="ltr"><div><div>Yes thank you my mistake. That is more than adequate for my needs. It just struck me as a little odd why anyone would use an int for large scale solvers.<br><br></div>Many thanks for the responses. <br><br></div>--Panos<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Jun 8, 2015 at 11:07 AM, Stefan Vigerske <span dir="ltr"><<a href="mailto:stefan@math.hu-berlin.de" target="_blank">stefan@math.hu-berlin.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hi,<span class=""><br>
<br>
On 06/08/2015 07:51 PM, Panos Lambrianides wrote:<br>
</span><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><span class="">
Hi everyone,<br>
<br>
I have a question about the largest size of the Jacobian for the<br>
constraints.<br>
<br>
While setting up the problem the variable nnz_jac_g is used to set up the<br></span>
number of non-zero constraint for the Jacobian. This is of type *Index*,<br>
which is itself an *int* in C++. The upper limit for int is 32767 (2^15-1).<br>
</blockquote>
<br>
I believe that int's are 32bit, so you get an upper limit of around <a href="tel:2147483647" value="+12147483647" target="_blank">2147483647</a>.<span class=""><br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Is there a reason why this is an int (versus a long for example) and more<br>
importantly is there a way to overcome this limitation? I would be happy<br>
to tweak the code if someone would point out the right places to do so.<br>
</blockquote>
<br></span>
There are some feature requests on this:<br>
<a href="https://projects.coin-or.org/Ipopt/ticket/251" target="_blank">https://projects.coin-or.org/Ipopt/ticket/251</a><br>
<a href="https://projects.coin-or.org/Ipopt/ticket/259" target="_blank">https://projects.coin-or.org/Ipopt/ticket/259</a><br>
<br>
The main thing to do is to extend a number of interfaces to 3rd-party software (linear algebra and linear solvers) to convert Ipopt's Index-arrays to their int-arrays, when necessary (or convince them to use also a long for indices).<span class="HOEnZb"><font color="#888888"><br>
<br>
Stefan<br>
</font></span></blockquote></div><br><br clear="all"><br>-- <br><div class="gmail_signature"><div dir="ltr"><div><div dir="ltr">Panos Lambrianides<div><a href="mailto:panos@soe.ucsc.edu" target="_blank">panos@soe.ucsc.edu</a></div><div>(415) 713-6718 (Mobile)<br></div><div><a href="https://sites.google.com/a/ucsc.edu/uncertainty-quantification/" target="_blank">https://sites.google.com/a/ucsc.edu/uncertainty-quantification/</a><br></div><div><br></div><div><br></div></div></div></div></div>
</div>