Dynamic programming and pseudo-inverses

Authors:
Y. Fan;R. Kalaba
Affiliations:
Department of Civil Engineering, School of Engineering, University of Southern California, Los Angeles, CA;Department of Economics, School of Engineering, University of Southern California, Los Angeles, CA
Venue:
Applied Mathematics and Computation
Year:
2003

Citing 4
Cited 1

Algorithms for generalized inverses

Journal of Optimization Theory and Applications
Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
Solving shortest length least-squares problems via dynamic programming

Journal of Optimization Theory and Applications
An alternative proof of the Greville formula

Journal of Optimization Theory and Applications

Effective partitioning method for computing weighted Moore-Penrose inverse

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.48

Visualization

Abstract

Dynamic programming can be used to obtain the generalized inverse of a matrix.