Pages that link to "Item:Q1896574"
From MaRDI portal
The following pages link to Solving shortest length least-squares problems via dynamic programming (Q1896574):
Displaying 4 items.
- Dynamic programming and pseudo-inverses (Q1406191) (← links)
- Dynamic programming and minimal norm solutions of least squares problems (Q1767947) (← links)
- The Bellman-Gauss principle for constrained motion (Q1963052) (← links)
- An alternative proof for the recursive formulae for computing the Moore--Penrose \(M\)-inverse of a matrix (Q2490193) (← links)