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
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84880733932&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/47761
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
Description
Summary: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.