mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-31 01:20:38 +08:00
092b94970a
The line search minimizer in Ceres does not require that the problems that is solving is a sum of squares. Over the past year there have been multiple requests to expose this algorithm on its own so that it can be used to solve unconstrained non-linear minimization problems on its own. With this change, a new optimization problem called GradientProblem is introduced which is basically a thin wrapper around a user defined functor that evaluates cost and gradients (FirstOrderFunction) and an optional LocalParameterization. Corresponding to it, a GradientProblemSolver and its associated options and summary structs are introduced too. An example that uses the new API to find the minimum of Rosenbrock's function is also added. Change-Id: I42bf687540da25de991e9bdb00e321239244e8b4