Dynamic programming and minimal norm solutions of least squares problems

DOI10.1016/J.CAMWA.2004.01.007MaRDI QIDQ1767947zbMATH OpenOpenAlexFDO

Authors R. E. Kalaba, Harriet H. Natsuyama

Publication date 8 March 2005

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2004.01.007

zbMATH Keywords

Dynamic programmingLeast squaresPseudoinverses

Mathematics Subject Classification ID

Dynamic programming (90C39) Theory of matrix inversion and generalized inverses (15A09) Least squares and related methods for stochastic control systems (93E24)

Recommendations

• Solving shortest length least-squares problems via dynamic programming
• Iterative algorithm for minimal norm least squares solution to general linear matrix equations
• A dynamic method for weighted linear least squares problems
• Direct recurrence algorithms for solving the linear equations of the method of least squares
• scientific article; zbMATH DE number 1294401

Cites work

• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 3225686 (Why is no real title available?)
• The Bellman-Gauss principle for constrained motion
• The estimation of parameters in time-dependent transport problems: Dynamic programming and associative memories

Cited in

(5)

• A dynamical system algorithm for solving a least squares problem with orthogonality constraints
• Solving shortest length least-squares problems via dynamic programming
• Statistical measures for least squares using the \(\alpha Q\beta R\) algorithm
• Dynamic programming and pseudo-inverses
• scientific article; zbMATH DE number 4195732 (Why is no real title available?)

This page was built for publication: Dynamic programming and minimal norm solutions of least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767947)