24#include <boost/tuple/tuple.hpp>
25#include <boost/shared_ptr.hpp>
26#include <boost/optional.hpp>
37class GaussianFactorGraph;
48 typedef boost::shared_ptr<IterativeOptimizationParameters> shared_ptr;
50 SILENT = 0, COMPLEXITY, ERROR
63 inline Verbosity verbosity()
const {
66 GTSAM_EXPORT std::string getVerbosity()
const;
67 GTSAM_EXPORT
void setVerbosity(
const std::string &s);
70 GTSAM_EXPORT
void print()
const;
73 GTSAM_EXPORT
virtual void print(std::ostream &os)
const;
76 friend std::ostream& operator<<(std::ostream &os,
79 GTSAM_EXPORT
static Verbosity verbosityTranslator(
const std::string &s);
80 GTSAM_EXPORT
static std::string verbosityTranslator(Verbosity v);
88 typedef boost::shared_ptr<IterativeSolver> shared_ptr;
96 boost::optional<const KeyInfo&> = boost::none,
97 boost::optional<
const std::map<Key, Vector>&> lambda = boost::none);
101 const std::map<Key, Vector> &lambda);
105 const KeyInfo &keyInfo,
const std::map<Key, Vector> &lambda,
115 size_t index, dim, start;
119 index(idx), dim(d), start(start) {
126class GTSAM_EXPORT
KeyInfo:
public std::map<Key, KeyInfoEntry> {
130 typedef std::map<Key, KeyInfoEntry> Base;
163 std::vector<size_t> colSpec()
const;
169 Vector x0vector()
const;
typedef and functions to augment Eigen's VectorXd
Variable ordering for the elimination algorithm.
Global functions in a separate testing namespace.
Definition: chartTesting.h:28
Point3 optimize(const NonlinearFactorGraph &graph, const Values &values, Key landmarkKey)
Optimize for triangulation.
Definition: triangulation.cpp:73
void print(const Matrix &A, const string &s, ostream &stream)
print without optional string, must specify cout yourself
Definition: Matrix.cpp:155
std::uint64_t Key
Integer nonlinear key type.
Definition: types.h:69
Definition: Ordering.h:34
A Linear Factor Graph is a factor graph where all factors are Gaussian, i.e.
Definition: GaussianFactorGraph.h:69
parameters for iterative linear solvers
Definition: IterativeSolver.h:44
Base class for Iterative Solvers like SubgraphSolver.
Definition: IterativeSolver.h:86
Handy data structure for iterative solvers key to (index, dimension, start)
Definition: IterativeSolver.h:114
Handy data structure for iterative solvers.
Definition: IterativeSolver.h:126
const Ordering & ordering() const
Return the ordering.
Definition: IterativeSolver.h:158
size_t numCols() const
Return the total number of columns (scalar variables = sum of dimensions)
Definition: IterativeSolver.h:153
KeyInfo()
Default Constructor.
Definition: IterativeSolver.h:142
This class represents a collection of vector-valued variables associated each with a unique integer i...
Definition: VectorValues.h:74