On the complexity of linear quadratic control

DOI10.1016/0377-2217(94)90268-2zbMath0804.49029MaRDI QIDQ1330536

Alfred L. Norman

Publication date: 16 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90268-2

zbMATH Keywords

computational complexity; linear quadratic control; MacRae approximation

Mathematics Subject Classification ID

49N10: Linear-quadratic optimal control problems

Related Items

Stochastic control for economic models: past, present and the paths ahead, Risk, uncertainty, and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to multiply matrices faster
• A value function arising in the economics of information
• On the control of structural models
• The optimal reward operator in dynamic programming
• The complexity of dynamic programming
• Matrix derivatives with an application to an adaptive linear decision problem
• Optimization of stochastic systems. Topics in discrete-time systems
• Controlling a Stochastic Process with Unknown Parameters
• Computational Complexity and Numerical Stability
• An Adaptive Learning Rule for Multiperiod Decision Problems
• Linear Quadratic Control Theory for Models with Long Lags
• Alternative Theoretical Frameworks for Finite Horizon Discrete-Time Stochastic Optimal Control
• Discounted Dynamic Programming
• Symbolic integration