commit f4d0164607d7bcacf02627e7eaa2e6c2f82affdb
author Sameer Agarwal <sameeragarwal@google.com> Mon Nov 26 12:55:58 2012 -0800
committer Gerrit Code Review <noreply-gerritcodereview@google.com> Wed Nov 28 16:18:01 2012 -0800
tree fa7bbecb527f6da586b0f5581b0c55f98f34cc1f
parent 0b5df70e33e7c9d64b3d9b90e21d1d1edd96e4a8

Add a line search based minimizer.

1. Add a line search based minimization loop.
2. Currently this loop supports steepest descent and three
   kinds of non-linear conjugate gradient algorithms.
3. Update SolverImpl to talk to LineSearchMinimizer.
4. Update IterationCallback to carry information about
   line search.
5. Update LineSearch to take the initial point as input,
   saving on one function evaluation.
6. Updates to the external API.

Change-Id: I901a0e89fc948451ab34c743e70f3dec57c9405e

jni/Android.mk

diff --git a/jni/Android.mk b/jni/Android.mk
index 0e1e6b9..349a9c1 100644
--- a/jni/Android.mk
+++ b/jni/Android.mk
@@ -123,6 +123,7 @@
                    $(CERES_SRC_PATH)/iterative_schur_complement_solver.cc \
                    $(CERES_SRC_PATH)/levenberg_marquardt_strategy.cc \
                    $(CERES_SRC_PATH)/line_search.cc \
+                   $(CERES_SRC_PATH)/line_search_minimizer.cc \
                    $(CERES_SRC_PATH)/linear_least_squares_problems.cc \
                    $(CERES_SRC_PATH)/linear_operator.cc \
                    $(CERES_SRC_PATH)/linear_solver.cc \