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...

Full description

Saved in:

Bibliographic Details
Main Authors:	K. Khunsmuth, T. Mouktonglang
Format:	Journal
Published:	2018
Subjects:	Mathematics
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/52749
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-52749
record_format	dspace
spelling	th-cmuir.6653943832-527492018-09-04T09:31:29Z Discrete multi-target linear-quadratic control problem and quadratic programming K. Khunsmuth T. Mouktonglang Mathematics 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. 2018-09-04T09:31:29Z 2018-09-04T09:31:29Z 2013-08-01 Journal 1312885X 2-s2.0-84880733932 10.12988/ams.2013.35279 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/52749
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Mathematics
spellingShingle	Mathematics K. Khunsmuth T. Mouktonglang Discrete multi-target linear-quadratic control problem and quadratic programming
description	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.
format	Journal
author	K. Khunsmuth T. Mouktonglang
author_facet	K. Khunsmuth T. Mouktonglang
author_sort	K. Khunsmuth
title	Discrete multi-target linear-quadratic control problem and quadratic programming
title_short	Discrete multi-target linear-quadratic control problem and quadratic programming
title_full	Discrete multi-target linear-quadratic control problem and quadratic programming
title_fullStr	Discrete multi-target linear-quadratic control problem and quadratic programming
title_full_unstemmed	Discrete multi-target linear-quadratic control problem and quadratic programming
title_sort	discrete multi-target linear-quadratic control problem and quadratic programming
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/52749
_version_	1681424007928217600

Discrete multi-target linear-quadratic control problem and quadratic programming

Similar Items