Solving shortest length least-squares problems via dynamic programming

DOI10.1007/BF02193059MaRDI QIDQ1896574zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 February 1996

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02193059

zbMATH Keywords

principle of optimalityleast-squares problemrank-deficient matricessequential fashionshortest solution

Mathematics Subject Classification ID

Quadratic programming (90C20) Dynamic programming (90C39)

Recommendations

• Dynamic programming and minimal norm solutions of least squares problems
• On least squares solutions subject to a rank restriction
• scientific article; zbMATH DE number 1264250
• scientific article; zbMATH DE number 5035464
• scientific article; zbMATH DE number 4131947

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• Algorithms for generalized inverses

Cited in

(4)

• Dynamic programming and minimal norm solutions of least squares problems
• The Bellman-Gauss principle for constrained motion
• Dynamic programming and pseudo-inverses
• An alternative proof for the recursive formulae for computing the Moore--Penrose M-inverse of a matrix

This page was built for publication: Solving shortest length least-squares problems via dynamic programming

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