#include <jrl-qp/test/problems.h>
Public Types | |
using | Base = std::conditional_t< Separated, SeparatedFeasibilityConstraints, FeasibilityConstraints > |
Public Member Functions | |
QPProblem ()=default | |
QPProblem (const QPProblem &)=default | |
QPProblem (QPProblem &&)=default | |
QPProblem & | operator= (const QPProblem &qp)=default |
QPProblem & | operator= (QPProblem &&qp)=default |
QPProblem (const QPProblem<!Separated > &qp) | |
template<bool LSSeparated> | |
QPProblem (const LeastSquareProblem< LSSeparated > &ls) | |
template<bool LSSeparated> | |
QPProblem & | operator= (const LeastSquareProblem< LSSeparated > &ls) |
QPProblem & | operator= (const QPProblem<!Separated > &qp) |
bool | wellFormed () const |
template<bool LSSeparated> | |
QPProblem< Separated > & | operator= (const LeastSquareProblem< LSSeparated > &ls) |
Public Attributes | |
Eigen::MatrixXd | G |
Eigen::VectorXd | a |
double | objCst = 0 |
Representation of the Linear least-square problem min. 0.5 x^T G x + a^T x + objCst s.t. feasibility constraints where the feasibility constraints are given by SeparatedFeasibilityConstraints if
Separated | = true and FeasibilityConstraints otherwise. |
using jrl::qp::test::QPProblem< Separated >::Base = std::conditional_t<Separated, SeparatedFeasibilityConstraints, FeasibilityConstraints> |
|
default |
|
default |
|
default |
|
inline |
|
inline |
QPProblem& jrl::qp::test::QPProblem< Separated >::operator= | ( | const LeastSquareProblem< LSSeparated > & | ls | ) |
|
inline |
|
default |
|
inline |
|
default |
|
inline |
Eigen::VectorXd jrl::qp::test::QPProblem< Separated >::a |
Eigen::MatrixXd jrl::qp::test::QPProblem< Separated >::G |
double jrl::qp::test::QPProblem< Separated >::objCst = 0 |