mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-30 09:00:37 +08:00
Fix typos in doc and errors in the demo code.
Change-Id: I237402958ed8747ae438643132fcab90113ac27d
This commit is contained in:
@@ -300,7 +300,7 @@ class CERES_EXPORT GradientProblemSolver {
|
||||
// to compute the next candidate step size as part of a line search.
|
||||
double line_search_polynomial_minimization_time_in_seconds = -1.0;
|
||||
|
||||
// Number of parameters in the probem.
|
||||
// Number of parameters in the problem.
|
||||
int num_parameters = -1;
|
||||
|
||||
// Dimension of the tangent space of the problem.
|
||||
@@ -329,7 +329,7 @@ class CERES_EXPORT GradientProblemSolver {
|
||||
// Once a least squares problem has been built, this function takes
|
||||
// the problem and optimizes it based on the values of the options
|
||||
// parameters. Upon return, a detailed summary of the work performed
|
||||
// by the preprocessor, the non-linear minmizer and the linear
|
||||
// by the preprocessor, the non-linear minimizer and the linear
|
||||
// solver are reported in the summary object.
|
||||
virtual void Solve(const GradientProblemSolver::Options& options,
|
||||
const GradientProblem& problem,
|
||||
|
||||
Reference in New Issue
Block a user