Total Least Norm Formulation and Solution for Structured Problems
From MaRDI portal
Publication:4870625
DOI10.1137/S0895479893258802zbMath0843.65028OpenAlexW2049757530WikidataQ60360081 ScholiaQ60360081MaRDI QIDQ4870625
John Glick, Haesun Park, J. Ben Rosen
Publication date: 27 March 1996
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479893258802
convergenceiterative algorithmnumerical resultsoverdetermined systemToeplitz matricestotal least squares methodstructured least norm method
Related Items (31)
Efficient implementation of a structured total least squares based speech compression method ⋮ Polynomial computations for blind image deconvolution ⋮ A regularized structured total least squares algorithm for high-resolution image reconstruction ⋮ Implementation of the regularized structured total least squares algorithms for blind image deblurring ⋮ Multiple delays estimation for chirp signals using structured total least squares ⋮ Solution of the linear regression problem using matrix correction methods in the \(l_1\) metric ⋮ A parameter estimation method for model analysis ⋮ Robustness of a discrete dynamical process with a given set of attainability ⋮ Accurate solution of polynomial equations using Macaulay resultant matrices ⋮ A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees ⋮ The Sylvester Resultant Matrix and Image Deblurring ⋮ Computing the radius of controllability for state space systems ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ The computation of multiple roots of a polynomial ⋮ Total least norm solution for linear structured EIV model ⋮ Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ Structured total least squares approach for efficient frequency estimation ⋮ High-performance numerical algorithms and software for structured total least squares ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ Computing lower rank approximations of matrix polynomials ⋮ Solving polynomial systems via symbolic-numeric reduction to geometric involutive form ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ A novel dictionary learning method based on total least squares approach with application in high dimensional biological data ⋮ An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems ⋮ Robust counterparts of errors-in-variables problems ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix ⋮ Solving total least-squares problems in information retrieval ⋮ A method for structured linear total least norm on blind deconvolution problem
This page was built for publication: Total Least Norm Formulation and Solution for Structured Problems
