Semi-Explicit Linear MPC Using a Warm-Started Active-Set QP Algorithm with Exact Complexity Guarantees.
Daniel ArnströmDaniel AxehillPublished in: CDC (2021)
Keyphrases
- active set
- computational complexity
- learning algorithm
- quadratic programming
- worst case
- linear programming
- objective function
- efficient implementation
- nonnegative matrix factorization
- np hard
- expectation maximization
- optimal solution
- similarity measure
- k means
- computationally intensive
- input data
- primal dual
- data sets