Approximation of convexly constrained pseudoinverse by hybrid steepest descent method

Abstract

Recently, a convexly constrained pseudoinverse problem unifying a wide class of signal processing problems was considered by Sabharwal and Potter. In this paper, we present a new algorithmic solution to this extremely important inverse problem. The proposed algorithm is straightforwardly derived from a theorem of the Hybrid Steepest Descent Method recently… (More)
DOI: 10.1109/ISCAS.1999.777505

Topics

Cite this paper

@inproceedings{Yamada1999ApproximationOC, title={Approximation of convexly constrained pseudoinverse by hybrid steepest descent method}, author={I. Yamada}, booktitle={ISCAS}, year={1999} }