Discrete multi-target linear-quadratic control problem and quadratic programming
We consider a discrete multi-target linear-quadratic control problem. We reduce the problem into a quadratic programming over a simplex. Computing the coefficients of the cost function requires knowing the descriptions of the orthogonal project onto the vector space Z and the orthogonal complement Z...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2018
|
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/47761 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |