Lines Matching refs:problem
60 LOG(FATAL) << "Unknown problem id requested " << id;
84 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem;
87 problem->b.reset(new double[3]);
88 problem->D.reset(new double[2]);
90 problem->x.reset(new double[2]);
91 problem->x_D.reset(new double[2]);
113 problem->A.reset(A);
115 problem->b[0] = 8;
116 problem->b[1] = 18;
117 problem->b[2] = -18;
119 problem->x[0] = 2.0;
120 problem->x[1] = 3.0;
122 problem->D[0] = 1;
123 problem->D[1] = 2;
125 problem->x_D[0] = 1.78448275;
126 problem->x_D[1] = 2.82327586;
127 return problem;
177 // BlockSparseMatrix version of this problem.
184 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem;
188 problem->b.reset(new double[num_rows]);
189 problem->D.reset(new double[num_cols]);
190 problem->num_eliminate_blocks = 2;
271 problem->A.reset(A);
274 problem->D.get()[i] = 1;
278 problem->b.get()[i] = i;
281 return problem;
289 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem;
291 problem->b.reset(new double[num_rows]);
292 problem->D.reset(new double[num_cols]);
293 problem->num_eliminate_blocks = 2;
390 problem->D.get()[i] = 1;
394 problem->b.get()[i] = i;
397 problem->A.reset(A);
399 return problem;
423 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem;
425 problem->b.reset(new double[num_rows]);
426 problem->D.reset(new double[num_cols]);
427 problem->num_eliminate_blocks = 2;
494 problem->D.get()[i] = 1;
498 problem->b.get()[i] = i;
501 problem->A.reset(A);
503 return problem;
