double compute_y0(const VectorValues &x0) const
y = max_j ( Cj*x0 - dj ) – due to the inequality constraints y >= Cx - d
std::shared_ptr< LP > shared_ptr
LP::shared_ptr buildInitialLP(Key yKey) const
build initial LP
InequalityFactorGraph addSlackVariableToInequalities(Key yKey, const InequalityFactorGraph &inequalities) const
Turn Cx <= d into Cx - y <= d factors.
Linear Factor Graph where all factors are Gaussians.
std::shared_ptr< This > shared_ptr
shared_ptr to this class
VectorValues solve() const
GaussianFactorGraph::shared_ptr buildInitOfInitGraph() const
Struct used to hold a Linear Programming Problem.
LPInitSolver(const LP &lp)
Construct with an LP problem.
friend class LPInitSolverInitializationTest
std::uint64_t Key
Integer nonlinear key type.
std::vector< std::pair< Key, Matrix > > collectTerms(const LinearInequality &factor) const
Collect all terms of a factor into a container.