Total Least Norm Formulation and Solution for Structured Problems
From MaRDI portal
Cited in
(43)- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Robust counterparts of errors-in-variables problems
- Solving total least-squares problems in information retrieval
- Total least norm solution for linear structured EIV model
- Efficient implementation of a structured total least squares based speech compression method
- 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
- A novel dictionary learning method based on total least squares approach with application in high dimensional biological data
- Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Computing lower rank approximations of matrix polynomials
- Robustness of a discrete dynamical process with a given set of attainability
- A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials
- Structured total least norm and approximate GCDs of inexact polynomials
- A method for structured linear total least norm on blind deconvolution problem
- Solution of the linear regression problem using matrix correction methods in the l₁ metric
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- An alternating semiproximal method for nonconvex regularized structured total least squares problems
- Polynomial computations for blind image deconvolution
- The Sylvester Resultant Matrix and Image Deblurring
- Computing the radius of controllability for state space systems
- The computation of multiple roots of a polynomial
- scientific article; zbMATH DE number 1058095 (Why is no real title available?)
- scientific article; zbMATH DE number 1058096 (Why is no real title available?)
- scientific article; zbMATH DE number 2076852 (Why is no real title available?)
- scientific article; zbMATH DE number 1748538 (Why is no real title available?)
- scientific article; zbMATH DE number 940918 (Why is no real title available?)
- Accurate solution of polynomial equations using Macaulay resultant matrices
- A convex relaxation to compute the nearest structured rank deficient matrix
- The computation of multiple roots of a Bernstein basis polynomial
- Structured total least norm for MISO ARX system identification
- Signal identification using a modify structured nonlinear total least norm algorithm
- Structured total least squares approach for efficient frequency estimation
- High-performance numerical algorithms and software for structured total least squares
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Regularized and structured tensor total least squares methods with applications
- Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
- A Geometry-Adaptive Regularized Newton-Type Method for Manifold-Affine Intersection Problems
- Randomized structured total-least-squares-based higher-order extended dynamic mode decomposition
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
- A parameter estimation method for model analysis
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
This page was built for publication: Total Least Norm Formulation and Solution for Structured Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870625)
