Parsimonious least norm approximation
From MaRDI portal
Publication:1273417
DOI10.1023/A:1018361916442zbMath0979.65032MaRDI QIDQ1273417
Publication date: 24 February 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018361916442
numerical tests; minimal cardinality; corrupted linear system; least norm approximation; linear-programming-based algorithm; parsimonious solution; successive linear approximation algorithm
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
A General Regularized Continuous Formulation for the Maximum Clique Problem, DC approximation approaches for sparse optimization, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\), Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets