Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/52749Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | K. Khunsmuth | en_US |
| dc.contributor.author | T. Mouktonglang | en_US |
| dc.date.accessioned | 2018-09-04T09:31:29Z | - |
| dc.date.available | 2018-09-04T09:31:29Z | - |
| dc.date.issued | 2013-08-01 | en_US |
| dc.identifier.issn | 1312885X | en_US |
| dc.identifier.other | 2-s2.0-84880733932 | en_US |
| dc.identifier.other | 10.12988/ams.2013.35279 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/52749 | - |
| dc.description.abstract | 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⊥ of the vector space Z. © 2013 K. Khunsmuth and T. Mouktonglang. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Discrete multi-target linear-quadratic control problem and quadratic programming | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Applied Mathematical Sciences | en_US |
| article.volume | 7 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.