commit | 9d02b76dce7af9036fc7980b8adc9e55bba4686c | [log] [tgz] |
---|---|---|
author | Sameer Agarwal <sameeragarwal@google.com> | Mon Feb 19 17:47:00 2018 -0800 |
committer | Sameer Agarwal <sameeragarwal@google.com> | Wed Feb 21 13:58:45 2018 -0800 |
tree | 4a1bbd11ff6516e30a060e91e21e2e5e4aea81f6 | |
parent | ff8a13d4a52a70818c4f7951a8dbf099cccc546e [diff] |
An implementation of SubsetPreconditioner. The key idea being, use some subset of the rows of the Jacobian as the preconditioner. This CL only implements the preconditioner assuming that the row selection has already been done. How the rows are selected will be left to the user based on their knowledge of the problem. A follow up CL will hook this preconditioner into the rest of the solver. Change-Id: I3e18dc57811116534e9ddf35d7b154bcce496d3b
Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It is a feature rich, mature and performant library which has been used in production at Google since 2010. Ceres Solver can solve two kinds of problems.
Please see ceres-solver.org for more information.
Ceres development happens on Gerrit, including both repository hosting and code reviews. The GitHub Repository is a continuously updated mirror which is primarily meant for issue tracking. Please see our Contributing to Ceres Guide for more details.
The upstream Gerrit repository is
https://ceres-solver.googlesource.com/ceres-solver