Put . The Bellman equation is . For the quadratic candidate , the quantity minimized isFor , completing the square gives . Matching the and constant terms requiresThe first equation is . Its admissible nonnegative root is , and . Hence .
A suitable discounted verification theorem is: if a nonnegative candidate satisfies the Bellman equation, a stationary minimizing selector has finite cost and its discounted expected terminal candidate tends to zero, and the same terminal limit holds for every finite-cost competing policy, then that selector is optimal and the candidate is the value function. Iterating the Bellman inequality proves the lower bound for each competing cost; iterating equality along the selector proves attainment. Here finite cost implies , so . Under the selector , the second moments are bounded by a geometric recursion, giving finite cost and the same terminal limit. Thus . Infinite-cost policies cannot improve the value.
For , the two coordinates decouple and have the same discount, so . The total value is .
For , the discount is and the state cost is . Introduce the orthogonal transformation , , with controls , . The cost becomes . Each transformed noise has mean zero and variance one; they need not be independent unless the original noises are Gaussian, and no such independence is needed here. The unpenalized difference coordinate has optimal control . For the sum coordinate, the quadratic coefficient solvesso , , and the constant is . ThereforeThe sum state is mean-square stable under this feedback; the uncontrolled difference state may wander, but its value function and state cost are both zero. The same verification argument applies to the penalized sum coordinate.
Articles by others on the same topic
There are currently no matching articles.