Article ID: | iaor20116954 |
Volume: | 150 |
Issue: | 2 |
Start Page Number: | 341 |
End Page Number: | 359 |
Publication Date: | Aug 2011 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Huang Lin, Peng Zhongxing, Yang Ying |
Keywords: | programming: linear, programming: quadratic, control |
This paper investigates the effects of adding input redundancies repeatedly into linear quadratic regulator (LQR) problems. As the number of input redundancies increases, three equivalent conditions are stated to guarantee a strict decrease of the minimum cost, which is constrained by a pair of lower and upper bounds. The contribution of a new added input redundancy to reduce the minimum cost will diminish after more redundancies are added. Moreover, the minimum cost will converge to zero as the number of input redundancies goes toward infinity, which is proven by transferring the LQR problem into a cheap control problem.