The stability of nonlinear least squares problems and the Cramer-Rao bound

DOI10.1109/78.887032zbMath1002.94004OpenAlexW2129914124MaRDI QIDQ2734433

Samit Basu, Yoram Bresler

Publication date: 14 August 2001

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.887032

zbMATH Keywords

stabilitynonlinear programmingsignal processingidentifiabilitynonlinear least squaresCramér-Rao boundmultichannel blind deconvolutionnonlinear parameter estimation problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (4)

Best linear near unbiased estimation for nonlinear signal models via semi-infinite programming approach ⋮ Separable nonlinear least-squares parameter estimation for complex dynamic systems ⋮ Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra ⋮ Moving-horizon state estimation for nonlinear discrete-time systems: new stability results and approximation schemes

This page was built for publication: The stability of nonlinear least squares problems and the Cramer-Rao bound