An explicit linear solution for the quadratic dynamic programming problem (Q1093562): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q440709 |
Changed an Item |
||
Property / author | |||
Property / author: Vera Zeidan / rank | |||
Normal rank |
Revision as of 22:50, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An explicit linear solution for the quadratic dynamic programming problem |
scientific article |
Statements
An explicit linear solution for the quadratic dynamic programming problem (English)
0 references
1988
0 references
For a given vector \(x_ 0\), the sequence \(\{x_ t\}\) which optimizes the sum of discounted rewards \(r(x_ t,x_{t+1})\), where r is a quadratic function, is shown to be generated by a linear decision rule \(x_{t+1}=Sx_ t+R\). Moreover, the coefficients R, S are given by explicit formulas in terms of the coefficients of the reward function r. A unique steady-state is shown to exist (except for a degenerate case), and its stability is discussed.
0 references
discrete-time control
0 references
linear decision rules
0 references
discounted rewards
0 references
unique steady-state
0 references
stability
0 references