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

DOI10.1016/j.acha.2007.02.002zbMath1133.65022OpenAlexW1977905043MaRDI QIDQ2465768

Boaz Matalon, Michael Zibulevsky, Michael Elad

Publication date: 8 January 2008

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2007.02.002

zbMATH Keywords

regularization inverse problems numerical experiments least squares denoising shrinkage sparsity proximal point basis pursuit coordinate-descent

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems ⋮ On some steplength approaches for proximal algorithms ⋮ Low-Rank and Sparse Dictionary Learning ⋮ Perspective functions: properties, constructions, and examples ⋮ An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring ⋮ Nonlinear regularization techniques for seismic tomography ⋮ An active set Newton-CG method for $\ell_1$ optimization ⋮ Inexact accelerated augmented Lagrangian methods ⋮ An optimal subgradient algorithm with subspace search for costly convex optimization problems ⋮ A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces ⋮ A preconditioned conjugate gradient method with active set strategy for $\ell_1$-regularized least squares ⋮ On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems ⋮ A local MM subspace method for solving constrained variational problems in image recovery ⋮ Restoration of images based on subspace optimization accelerating augmented Lagrangian approach ⋮ Gradient-based method with active set strategy for $\ell _1$ optimization ⋮ Incremental proximal methods for large scale convex optimization ⋮ Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods ⋮ Image restoration by a mixed high-order total variation and $l_1$ regularization model ⋮ Total variation image restoration method based on subspace optimization ⋮ Sequential subspace optimization for nonlinear inverse problems ⋮ Incremental projection approach of regularization for inverse problems ⋮ The projected GSURE for automatic parameter tuning in iterative shrinkage methods ⋮ Acceleration of the generalized Landweber method in Banach spaces via sequential subspace optimization ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ Iterative thresholding for sparse approximations ⋮ Linear convergence of iterative soft-thresholding ⋮ On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems ⋮ The Little Engine that Could: Regularization by Denoising (RED) ⋮ An accelerated homotopy-perturbation-Kaczmarz method for solving nonlinear inverse problems ⋮ Coordinate descent with arbitrary sampling I: algorithms and complexity^† ⋮ A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ A Common Network Architecture Efficiently Implements a Variety of Sparsity-Based Inference Problems ⋮ Greedy approximation in convex optimization ⋮ Nomonotone spectral gradient method for sparse recovery ⋮ Robust Data Assimilation Using $L_1$ and Huber Norms

Uses Software

PDCO

Cites Work