dprintf 95 modules/core/src/conjugate_gradient.cpp dprintf(("before minimizeOnTheLine\n")); dprintf 96 modules/core/src/conjugate_gradient.cpp dprintf(("x:\n")); dprintf 98 modules/core/src/conjugate_gradient.cpp dprintf(("d:\n")); dprintf 103 modules/core/src/conjugate_gradient.cpp dprintf(("buf1:\n")); dprintf 107 modules/core/src/conjugate_gradient.cpp dprintf(("buf2:\n")); dprintf 114 modules/core/src/conjugate_gradient.cpp dprintf(("(buf2.dot(d)-buf1.dot(d))=%f\nalpha=%f\n",(buf2.dot(d)-buf1.dot(d)),alpha)); dprintf 119 modules/core/src/conjugate_gradient.cpp dprintf(("after minimizeOnTheLine\n")); dprintf 125 modules/core/src/conjugate_gradient.cpp dprintf(("termcrit:\n\ttype: %d\n\tmaxCount: %d\n\tEPS: %g\n",_termcrit.type,_termcrit.maxCount,_termcrit.epsilon)); dprintf 154 modules/core/src/conjugate_gradient.cpp dprintf(("proxy_x\n"));print_matrix(proxy_x); dprintf 155 modules/core/src/conjugate_gradient.cpp dprintf(("d first time\n"));print_matrix(d); dprintf 156 modules/core/src/conjugate_gradient.cpp dprintf(("r\n"));print_matrix(r); dprintf 157 modules/core/src/downhill_simplex.cpp dprintf(("m.cols=%d\nm.rows=%d\n", m.cols, m.rows)); dprintf 180 modules/core/src/downhill_simplex.cpp dprintf(("hi from minimize\n")); dprintf 185 modules/core/src/downhill_simplex.cpp dprintf(("termcrit:\n\ttype: %d\n\tmaxCount: %d\n\tEPS: %g\n",_termcrit.type,_termcrit.maxCount,_termcrit.epsilon)); dprintf 186 modules/core/src/downhill_simplex.cpp dprintf(("step\n")); dprintf 195 modules/core/src/downhill_simplex.cpp dprintf(("%d iterations done\n",count)); dprintf 230 modules/core/src/downhill_simplex.cpp dprintf(("\nupdated coord sum:\n")); dprintf 261 modules/core/src/downhill_simplex.cpp dprintf(("\nthis is simplex\n")); dprintf 323 modules/core/src/downhill_simplex.cpp dprintf(("\nthis is y on iteration %d:\n",fcount)); dprintf 358 modules/core/src/downhill_simplex.cpp dprintf(("\ny_lo=%g, y_nhi=%g, y_hi=%g, y_alpha=%g, p_alpha:\n", y_lo, y_nhi, y_hi, y_alpha)); dprintf 368 modules/core/src/downhill_simplex.cpp dprintf(("\ny_beta=%g, p_beta:\n", y_beta)); dprintf 384 modules/core/src/downhill_simplex.cpp dprintf(("\ny_gamma=%g, p_gamma:\n", y_gamma)); dprintf 406 modules/core/src/downhill_simplex.cpp dprintf(("\nthis is simplex on iteration %d\n",fcount)); dprintf 95 modules/core/src/lpsolver.cpp dprintf(("call to solveLP\n")); dprintf 189 modules/core/src/lpsolver.cpp dprintf(("\tWE MAKE PIVOT\n")); dprintf 196 modules/core/src/lpsolver.cpp dprintf(("\tAFTER INNER_SIMPLEX\n")); dprintf 218 modules/core/src/lpsolver.cpp dprintf(("after swaps\n")); dprintf 226 modules/core/src/lpsolver.cpp dprintf(("I=%d from nonbasic\n",I)); dprintf 231 modules/core/src/lpsolver.cpp dprintf(("I=%d from basic\n",I)); dprintf 239 modules/core/src/lpsolver.cpp dprintf(("after restore\n")); dprintf 252 modules/core/src/lpsolver.cpp dprintf(("iteration #%d\n",count)); dprintf 270 modules/core/src/lpsolver.cpp dprintf(("hello from e==-1\n")); dprintf 300 modules/core/src/lpsolver.cpp dprintf(("the tightest constraint is in row %d with %g\n",l,min)); dprintf 304 modules/core/src/lpsolver.cpp dprintf(("objective, v=%g\n",v)); dprintf 306 modules/core/src/lpsolver.cpp dprintf(("constraints\n")); dprintf 308 modules/core/src/lpsolver.cpp dprintf(("non-basic: ")); dprintf 310 modules/core/src/lpsolver.cpp dprintf(("basic: ")); dprintf 348 modules/core/src/lpsolver.cpp dprintf(("v was %g\n",v));