Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization (Q2465768)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5223902
Language Label Description Also known as
default for all languages
No label defined
    English
    Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
    scientific article; zbMATH DE number 5223902

      Statements

      Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization (English)
      0 references
      0 references
      0 references
      0 references
      8 January 2008
      0 references
      The authors consider the problem of linear least squares with non-quadratic regularization (RLS) in the form: minimize \(\{ \|Az - b\|^2 + \rho (z) \}\), for \(z \in\mathbb R^n\), where \(A\) is an \(m \times n, (m < n)\) full rank matrix. They prove that for this problem the parallel coordinate descent algorithm (previously proposed by one of the authors), the expectation-maximization one and a shrinkage minimization method are essentially equivalent for the numerical solution of the RLS problem. Some image denoising numerical experiments are also presented.
      0 references
      least squares
      0 references
      regularization
      0 references
      inverse problems
      0 references
      denoising
      0 references
      shrinkage
      0 references
      basis pursuit
      0 references
      sparsity
      0 references
      coordinate-descent
      0 references
      proximal point
      0 references
      numerical experiments
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers