QPSolver.h
Go to the documentation of this file.
1 /* ----------------------------------------------------------------------------
2 
3  * GTSAM Copyright 2010, Georgia Tech Research Corporation,
4  * Atlanta, Georgia 30332-0415
5  * All Rights Reserved
6  * Authors: Frank Dellaert, et al. (see THANKS for the full author list)
7 
8  * See LICENSE for the license information
9 
10  * -------------------------------------------------------------------------- */
11 
23 #include <limits>
24 #include <algorithm>
25 
26 namespace gtsam {
27 
29 struct QPPolicy {
32  static constexpr double maxAlpha = 1.0;
33 
35  static const GaussianFactorGraph buildCostFunction(const QP& qp,
36  const VectorValues& xk = VectorValues()) {
37  GaussianFactorGraph no_constant_factor;
38  for (auto factor : qp.cost) {
39  HessianFactor hf = static_cast<HessianFactor>(*factor);
40  no_constant_factor.push_back(hf);
41  }
42  return no_constant_factor;
43  }
44 };
45 
47 
48 }
Active set method for solving LP, QP problems.
IsDerived< DERIVEDFACTOR > push_back(boost::shared_ptr< DERIVEDFACTOR > factor)
Add a factor directly using a shared_ptr.
Definition: FactorGraph.h:166
GaussianFactorGraph cost
Quadratic cost factors.
Definition: QP.h:32
static const GaussianFactorGraph buildCostFunction(const QP &qp, const VectorValues &xk=VectorValues())
Simply the cost of the QP problem.
Definition: QPSolver.h:35
traits
Definition: chartTesting.h:28
Factor graphs of a Quadratic Programming problem.
Policy for ActivetSetSolver to solve Linear Programming.
Definition: QPSolver.h:29
A Gaussian factor using the canonical parameters (information form)
static constexpr double maxAlpha
Definition: QPSolver.h:32
This finds a feasible solution for a QP problem.
Definition: QP.h:31


gtsam
Author(s):
autogenerated on Sat May 8 2021 02:43:44