38 for (
auto factor : qp.
cost) {
42 return no_constant_factor;
46using QPSolver = ActiveSetSolver<QP, QPPolicy, QPInitSolver>;
This finds a feasible solution for a QP problem.
Active set method for solving LP, QP problems.
Factor graphs of a Quadratic Programming problem.
Global functions in a separate testing namespace.
Definition: chartTesting.h:28
IsDerived< DERIVEDFACTOR > push_back(boost::shared_ptr< DERIVEDFACTOR > factor)
Add a factor directly using a shared_ptr.
Definition: FactorGraph.h:165
A Linear Factor Graph is a factor graph where all factors are Gaussian, i.e.
Definition: GaussianFactorGraph.h:69
A Gaussian factor using the canonical parameters (information form)
Definition: HessianFactor.h:101
This class represents a collection of vector-valued variables associated each with a unique integer i...
Definition: VectorValues.h:74
Struct contains factor graphs of a Quadratic Programming problem.
Definition: QP.h:31
GaussianFactorGraph cost
Quadratic cost factors.
Definition: QP.h:32
Policy for ActivetSetSolver to solve Linear Programming.
Definition: QPSolver.h:29
static constexpr double maxAlpha
Maximum alpha for line search x'=xk + alpha*p, where p is the cost gradient For QP,...
Definition: QPSolver.h:32
static const GaussianFactorGraph buildCostFunction(const QP &qp, const VectorValues &xk=VectorValues())
Simply the cost of the QP problem.
Definition: QPSolver.h:35