<div dir="ltr">Hello,<br><br>As a subsolver to an active-set method NLP solver, I want to solve a bunch of LPs regarding Jacobian of constraints.<br>Since at every iterate, the Jacobian matrix changes. But sparsity of constraints are not different at each iterate.<br>
Only the values in the constraints are changing but all LPs have same sparsity pattern. What is the most efficient way to do this?<br><br>I intended to use <br><br>void <a class="el" href="http://www.coin-or.org/Doxygen/Clp/class_clp_model.html#7319fac2234a6472005b2d45780ab9ee">modifyCoefficient</a> (int row, int column, double newElement, bool keepZero=false)<br>
<br>But from the source code, I can see that it is not implemented in ClpMatrixBase.cpp:<br><br>void <br>ClpMatrixBase::modifyCoefficient(int row, int column, double newElement,<br> bool keepZero)<br>{ <br> std::cerr<<"modifyCoefficient not supported - ClpMatrixBase"<<std::endl;<br>
abort();<br>}<br><br>Other than changing whole CoinPackedMatrix, is there a more efficient way?<br>
<br>Thanks,<br>Mustafa<br> </div>