Solving shortest length least-squares problems via dynamic programming

DOI10.1007/BF02193059zbMath0831.90118OpenAlexW2033322024MaRDI QIDQ1896574

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

rank-deficient matricesprinciple of optimalityleast-squares problemsequential fashionshortest solution

Mathematics Subject Classification ID

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

Related Items (3)

Dynamic programming and pseudo-inverses ⋮ The Bellman-Gauss principle for constrained motion ⋮ An alternative proof for the recursive formulae for computing the Moore--Penrose \(M\)-inverse of a matrix

Cites Work

• Algorithms for generalized inverses
• Unnamed Item
• Unnamed Item

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