Abstract
A linear-quadratic optimization problem is formulated in a dynamic programming manner. An updating formula for obtaining the solutions to such a problem is provided and illustrated using a few simple examples. This updating formula is also compared to a well-known updating formula for obtaining the inverses of symmetric positive-definite matrices. Numerical results are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have