public class QPSolver
extends java.lang.Object
Constructor and Description |
---|
QPSolver() |
Modifier and Type | Method and Description |
---|---|
VectorNd |
solve(java.util.List<QPCostTerm> costTerms,
java.util.List<QPConstraintTerm> constraintTerms,
int size,
double t0,
double t1)
Solves the quadratic program of the form:
|
public VectorNd solve(java.util.List<QPCostTerm> costTerms, java.util.List<QPConstraintTerm> constraintTerms, int size, double t0, double t1)
min { 1/2 x^T Q x + x^T p } A x >= b, Aeq x = beqand returns the solution vector. Q and P are assembled form the cost termss, while A, b, Aeq and beq are assembled from the constraint terms, with inequality terms contributing to A and b and equality terms contributing to Aeq and beq.
costTerms
- terms used to assemble Q and pconstraintTerms
- terms used to assemble A, b, Aeq and beq.size
- size of the programt0
- time step start timet1
- time step end time