Lines Matching refs:ceres
0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/crs_matrix.h"
38 #include "ceres/internal/macros.h"
39 #include "ceres/internal/port.h"
40 #include "ceres/iteration_callback.h"
41 #include "ceres/ordered_groups.h"
42 #include "ceres/types.h"
44 namespace ceres {
164 // Number of threads used by Ceres for evaluating the cost and
223 // Ceres supports using multiple sparse linear algebra libraries
226 // whether they are linked into Ceres at build time.
229 // Number of threads used by Ceres to solve the Newton
241 // Ceres allows the user to provide varying amounts of hints to
250 // communicate this information to Ceres.
258 // Given such an ordering, Ceres ensures that the parameter blocks in
261 // each group, Ceres is free to order the parameter blocks as it
282 // Thus, to have Ceres determine the ordering automatically using
305 // By virtue of the modeling layer in Ceres being block oriented,
306 // all the matrices used by Ceres are also block oriented. When
373 // version of Ceres has a higher iteration complexity, but also
576 // matrices. Please see ceres/crs_matrix.h for more details of the
591 // occurs, Ceres performs a number of preprocessing steps. These
604 // Some total of all time spent inside Ceres when Solve is called.
652 } // namespace ceres
