inline void pdxxxresid1(ClpPdco *model, const int nlow, const int nupp, const int nfix,
int *low, int *upp, int *fix,
CoinDenseVector <double> &b, double *bl, double *bu, double d1, double d2,
CoinDenseVector <double> &grad, CoinDenseVector <double> &rL,
CoinDenseVector <double> &rU, CoinDenseVector <double> &x,
CoinDenseVector <double> &x1, CoinDenseVector <double> &x2,
CoinDenseVector <double> &y, CoinDenseVector <double> &z1,
CoinDenseVector <double> &z2, CoinDenseVector <double> &r1,
CoinDenseVector <double> &r2, double *Pinf, double *Dinf)
{
// Form residuals for the primal and dual equations.
// rL, rU are output, but we input them as full vectors
// initialized (permanently) with any relevant zeros.
// Get some element pointers for efficiency
double *x_elts = x.getElements();
double *r2_elts = r2.getElements();
for (int k = 0; k < nfix; k++)
x_elts[fix[k]] = 0;
r1.clear();
r2.clear();
model->matVecMult( 1, r1, x );
model->matVecMult( 2, r2, y );
for (int k = 0; k < nfix; k++)
r2_elts[fix[k]] = 0;
r1 = b - r1 - d2 * d2 * y;
r2 = grad - r2 - z1; // grad includes d1*d1*x
if (nupp > 0)
r2 = r2 + z2;
for (int k = 0; k < nlow; k++)
rL[low[k]] = bl[low[k]] - x[low[k]] + x1[low[k]];
for (int k = 0; k < nupp; k++)
rU[upp[k]] = - bu[upp[k]] + x[upp[k]] + x2[upp[k]];
double normL = 0.0;
double normU = 0.0;
for (int k = 0; k < nlow; k++)
if (rL[low[k]] > normL) normL = rL[low[k]];
for (int k = 0; k < nupp; k++)
if (rU[upp[k]] > normU) normU = rU[upp[k]];
*Pinf = CoinMax(normL, normU);
*Pinf = CoinMax( r1.infNorm() , *Pinf );
*Dinf = r2.infNorm();
*Pinf = CoinMax( *Pinf, 1e-99 );
*Dinf = CoinMax( *Dinf, 1e-99 );
}
