Fix dense Cholesky refinement residual storage

DenseCholesky accepts a column-major lower triangle. Map that storage
explicitly and use its lower self-adjoint view for refinement residuals.

Poison unused triangles in the existing backend and size tests. Compute
the right-hand side before poisoning the input. Direct refiner tests
retain a full-matrix reference and factorization. Preserve tolerances
and iteration limits.

Issue: https://github.com/ceres-solver/ceres-solver/issues/863

Codex used.

Change-Id: I06d272ac382de5aecd6805a02d5f9c996aa88a4f
3 files changed
tree: d37781bd536424b3ad6a8ec65f401ae0d03644e6
  1. .github/
  2. bazel/
  3. cmake/
  4. config/
  5. data/
  6. docs/
  7. examples/
  8. include/
  9. internal/
  10. LICENSES/
  11. scripts/
  12. third_party/
  13. .bazelignore
  14. .clang-format
  15. .gitignore
  16. .gitmodules
  17. .readthedocs.yaml
  18. BUILD
  19. CITATION.cff
  20. CMakeLists.txt
  21. CONTRIBUTING.md
  22. LICENSE
  23. MODULE.bazel
  24. package.xml
  25. README.md
  26. REUSE.toml
  27. WORKSPACE
README.md

Android Linux macOS Windows

Ceres Solver

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.

  1. Non-linear Least Squares problems with bounds constraints.
  2. General unconstrained optimization problems.

Please see ceres-solver.org for more information.