Smoothed $\ell_1$-regularization-based line search for sparse signal recovery (Q1701931)

scientific article

Language	Label	Description	Also known as
English	Smoothed $\ell_1$-regularization-based line search for sparse signal recovery	scientific article

Statements

instance of

scholarly article

0 references

title

Smoothed $\ell_1$-regularization-based line search for sparse signal recovery (English)

0 references

zbMATH Open document ID

1387.94049

0 references

DOI

10.1007/s00500-016-2423-4

0 references

0 references

0 references

27 February 2018

0 references

Mathematics Subject Classification ID

0 references

0 references

high dynamic range signal

0 references

sparse recovery

0 references

line search

0 references

quasi-Newton method

0 references

smoothed $\ell_1$ regularization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00500-016-2423-4

0 references

OpenAlex ID

W2551940024

0 references

cites work

An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion

0 references

Minimization of functions having Lipschitz continuous first partial derivatives

0 references

Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization

0 references

Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy

0 references

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

0 references

Templates for convex cone problems with applications to sparse signal recovery

0 references

An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Compressed sensing with coherent and redundant dictionaries

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Why Simple Shrinkage Is Still Relevant for Redundant Representations?

0 references

Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis

0 references

Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

0 references

A parallel alternating direction method with application to compound $l_{1}$-regularized imaging inverse problems

0 references

A class of nonlinear proximal point algorithms for variational inequality problems

0 references

Visual Tracking via Coarse and Fine Structural Local Sparse Appearance Models

0 references

An alternating direction method with continuation for nonconvex low rank minimization

0 references

Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets

0 references

Efficient iterative computation of mixture weights for pooled order statistics for meta-analysis of multiple type-II right censored data

0 references

Sparse tensor discriminant analysis

0 references

Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers

0 references

Smooth minimization of non-smooth functions

0 references

Smoothing and Decomposition for Analysis Sparse Recovery

0 references

A class of gradient unconstrained minimization algorithms with adaptive stepsize

0 references

Convergence Conditions for Ascent Methods

0 references

Convergence Conditions for Ascent Methods. II: Some Corrections

0 references

Sparse Reconstruction by Separable Approximation

0 references

Primal and dual alternating direction algorithms for $\ell _{1}$-$\ell _{1}$-norm minimization problems in compressive sensing

0 references

Vector Sparse Representation of Color Image Using Quaternion Matrix Analysis

0 references

Postbuckling analysis of microscale beams based on a strain gradient finite element approach

0 references

Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

0 references

Estimation of Signal-Dependent Noise Level Function in Transform Domain via a Sparse Recovery Model

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique

0 references

A fast proximal point algorithm for $\ell_{1}$-minimization problem in compressed sensing

0 references

Quaternion Collaborative and Sparse Representation With Application to Color Face Recognition

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1701931

Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931)

Statements

Sitelinks

Mathematics(1 entry)