Lines Matching defs:an
32 (non-)solution this class finds an optimal solution. The optimization
36 It does so by implementing an active set method algorithm. The basic idea
591 If \a equality is \c true, the constraint is an equality constraint.
758 const int an = fVariableCount;
760 zero_matrix(fActiveMatrix, am, an);
773 independentRows, am, an);
792 // Which is an system we can solve:
797 bool independentColumns[an];
799 transpose_matrix(fActiveMatrix, aa, am, an);
801 independentColumns, an, am);
813 for (int i = 0; i < an; i++) {
905 const int an = fVariableCount;
910 transpose_matrix(fActiveMatrix, fTemp1, am, an);
911 bool success = qr_decomposition(fTemp1, an, am, tempD, Q);
918 const int zm = an;
919 const int zn = an - am;
934 multiply_optimization_matrix_matrix(Z, an, zn, fTemp1);