@@ -290,7 +290,7 @@ namespace eiquadprog
290290 size_t iq; // current number of active constraints
291291 double psi; // current sum of constraint violations
292292 double c1; // Hessian trace
293- double c2; // Hessian Chowlesky factor trace
293+ double c2; // Hessian Cholesky factor trace
294294 double ss; // largest constraint violation (negative for violation)
295295 double R_norm; // norm of matrix R
296296 const double inf = std::numeric_limits<double >::infinity ();
@@ -309,9 +309,9 @@ namespace eiquadprog
309309 /* decompose the matrix Hess in the form LL^T */
310310 if (!is_inverse_provided_)
311311 {
312- START_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOWLESKY_DECOMPOSITION );
312+ START_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOLESKY_DECOMPOSITION );
313313 chol_.compute (Hess);
314- STOP_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOWLESKY_DECOMPOSITION );
314+ STOP_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOLESKY_DECOMPOSITION );
315315 }
316316
317317
@@ -324,14 +324,14 @@ namespace eiquadprog
324324 // m_J = L^-T
325325 if (!is_inverse_provided_)
326326 {
327- START_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOWLESKY_INVERSE );
327+ START_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOLESKY_INVERSE );
328328 m_J.setIdentity (nVars, nVars);
329329#ifdef OPTIMIZE_HESSIAN_INVERSE
330330 chol_.matrixU ().solveInPlace (m_J);
331331#else
332332 m_J = chol_.matrixU ().solve (m_J);
333333#endif
334- STOP_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOWLESKY_INVERSE );
334+ STOP_PROFILER_EIQUADPROG_FAST (EIQUADPROG_FAST_CHOLESKY_INVERSE );
335335 }
336336
337337 c2 = m_J.trace ();
0 commit comments