Sparse Reconstruction by Separable Approximation

DOI10.1109/TSP.2009.2016892zbMath1391.94442OpenAlexW2126607811WikidataQ60962400 ScholiaQ60962400MaRDI QIDQ4569734

Stephen J. Wright, Mario A. T. Figueiredo, Robert D. Nowak

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2009.2016892

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization, Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, An Iterative Reduction FISTA Algorithm for Large-Scale LASSO, Sparse regularized fuzzy regression, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, An augmented Lagrangian method for optimization problems with structured geometric constraints, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, Signal approximations based on nonlinear and optimal piecewise affine functions, Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints, An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Optimal polynomial feedback laws for finite horizon control problems, Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications, Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum, Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, An easily implementable algorithm for efficient projection onto the ordered weighted \(\ell_1\) norm ball, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, Proximal quasi-Newton method for composite optimization over the Stiefel manifold, Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions, Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions, Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization, Open issues and recent advances in DC programming and DCA, A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems, Sparse and switching infinite horizon optimal controls with mixed-norm penalizations, $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames, A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**, A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints, Hybrid Projection Methods with Recycling for Inverse Problems, Unnamed Item, Unnamed Item, Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction, Truncated $L^1$ Regularized Linear Regression: Theory and Algorithm, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, Structured sparsity through convex optimization, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, Generalized Conjugate Gradient Methods for ℓ₁ Regularized Convex Quadratic Programming with Finite Convergence, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Sparse reconstructions of acoustic source for inverse scattering problems in measure space, High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso, On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs, Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem, On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence, A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization, A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations, A partial inexact alternating direction method for structured variational inequalities, Flexible Krylov Methods for $\ell_p$ Regularization, Sparse 3D reconstructions in electrical impedance tomography using real data, Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming, Hybrid Projection Methods with Recycling for Inverse Problems, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, Unnamed Item, A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁regularized problem, Projected Newton method for noise constrained Tikhonov regularization, Minimization of $\ell_{1-2}$ for Compressed Sensing, Fused Multiple Graphical Lasso, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, Regularisation, optimisation, subregularity, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising, Sparse Solutions of a Class of Constrained Optimization Problems, An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint, First-Order Algorithms for a Class of Fractional Optimization Problems, Combining line search and trust-region methods forℓ1-minimization, Robust Data Assimilation Using $L_1$ and Huber Norms, Efficient projection algorithms onto the weighted \(\ell_1\) ball, An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Linearized alternating direction method of multipliers for sparse group and fused Lasso models, A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, Image deblurring by sparsity constraint on the Fourier coefficients, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, A proximal method for composite minimization, Inexact coordinate descent: complexity and preconditioning, A truncated Newton algorithm for nonconvex sparse recovery, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, A family of second-order methods for convex \(\ell _1\)-regularized optimization, An active set algorithm for nonlinear optimization with polyhedral constraints, Ensemble extreme learning machine and sparse representation classification, Practical inexact proximal quasi-Newton method with global complexity analysis, On globally Q-linear convergence of a splitting method for group Lasso, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, Landmark recognition with sparse representation classification and extreme learning machine, Screening for a reweighted penalized conditional gradient method, A regularized semi-smooth Newton method with projection steps for composite convex programs, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere, Approximation accuracy, gradient methods, and error bound for structured convex optimization, The convex geometry of linear inverse problems, Inexact accelerated augmented Lagrangian methods, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems, Block coordinate descent algorithms for large-scale sparse multiclass classification, Spatio-temporal random fields: compressible representation and distributed estimation, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Optimal nonlinear signal approximations based on piecewise constant functions, SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, Shrinking gradient descent algorithms for total variation regularized image denoising, Sampling in the analysis transform domain, Sparse representation based Fisher discrimination dictionary learning for image classification, Restoration of images based on subspace optimization accelerating augmented Lagrangian approach, A modified proximal gradient method for a family of nonsmooth convex optimization problems, Error forgetting of Bregman iteration, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, Bregman operator splitting with variable stepsize for total variation image reconstruction, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, A unified formulation for generalized oilfield development optimization, New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems, A new analysis on the Barzilai-Borwein gradient method, Bound alternative direction optimization for image deblurring, An infeasible-point subgradient method using adaptive approximate projections, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, A novel model and ADMM algorithm for MR image reconstruction, Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing, An ADMM algorithm for second-order TV-based MR image reconstruction, Learning circulant sensing kernels, A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares, Optimal computational and statistical rates of convergence for sparse nonconvex learning problems, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, A new generalized shrinkage conjugate gradient method for sparse recovery, A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations, Primal-dual active-set methods for large-scale optimization, A Barzilai-Borwein type method for minimizing composite functions, Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, Level-set methods for convex optimization, Inexact variable metric stochastic block-coordinate descent for regularized optimization, A proximal difference-of-convex algorithm with extrapolation, A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems, A generalized matrix Krylov subspace method for TV regularization, Decomposable norm minimization with proximal-gradient homotopy algorithm, Incremental projection approach of regularization for inverse problems, Iterative reweighted methods for \(\ell _1-\ell _p\) minimization, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, A performance guarantee for orthogonal matching pursuit using mutual coherence, A global sparse gradient based coupled system for image denoising, Templates for convex cone problems with applications to sparse signal recovery, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, A box constrained gradient projection algorithm for compressed sensing, A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction, An augmented Lagrangian approach for sparse principal component analysis, Sample size selection in optimization methods for machine learning, Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions, Globalized inexact proximal Newton-type methods for nonconvex composite functions, An efficient algorithm for joint feature screening in ultrahigh-dimensional Cox's model, A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix, Rician noise removal via weighted nuclear norm penalization, Monocular extraction of 2.1D sketch using constrained convex optimization, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, An MM Algorithm for Split Feasibility Problems, GPU accelerated greedy algorithms for compressed sensing, Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems, Exploring chaotic attractors in nonlinear dynamical system under fractal theory, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, Manifold reconstruction and denoising from scattered data in high dimension, On the acceleration of the Barzilai-Borwein method, Nomonotone spectral gradient method for sparse recovery, 3D reconstruction for partial data electrical impedance tomography using a sparsity prior, A fast \(\ell_1\)-solver and its applications to robust face recognition, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Further properties of the forward-backward envelope with applications to difference-of-convex programming, LEARNING AN ADAPTIVE DICTIONARY USING A PROJECTED GRADIENT METHOD AND ITS APPLICATION ON IMAGE DE-NOISING, A reconstruction algorithm for electrical impedance tomography based on sparsity regularization, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring, Linear reconstruction measure steered nearest neighbor classification framework, Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions, On the rate of convergence of projected Barzilai–Borwein methods, An algorithm for quadratic ℓ₁-regularized optimization with a flexible active-set strategy, Structured Sparsity: Discrete and Convex Approaches, A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems, Sparsity Constrained Estimation in Image Processing and Computer Vision, An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring, Efficient block-coordinate descent algorithms for the group Lasso, Extracting Sparse High-Dimensional Dynamics from Limited Data, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, Adaptive control and signal processing literature survey (No. 14), Unnamed Item, An active set Newton-CG method for \(\ell_1\) optimization, Iterative methods based on soft thresholding of hierarchical tensors, An optimal subgradient algorithm for large-scale bound-constrained convex optimization, Globally sparse and locally dense signal recovery for compressed sensing, Performance comparisons of greedy algorithms in compressed sensing, CMD: controllable matrix decomposition with global optimization for deep neural network compression, Accelerating block coordinate descent methods with identification strategies, Inexact successive quadratic approximation for regularized optimization, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization, Operator inference for non-intrusive model reduction with quadratic manifolds, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, A simple homotopy proximal mapping algorithm for compressive sensing, Sparsity reconstruction in electrical impedance tomography: an experimental evaluation, Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula, An improved variational model for denoising magnetic resonance images, Gradient-based method with active set strategy for $\ell _1$ optimization, A First-Order Primal-Dual Algorithm with Linesearch, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D, A relaxed-PPA contraction method for sparse signal recovery, Shearlet-based regularized reconstruction in region-of-interest computed tomography, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF, An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, An Introduction to Compressed Sensing, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, PRP-like algorithm for monotone operator equations, FaRSA for ℓ₁-regularized convex optimization: local convergence and numerical experience, Optimization Methods for Large-Scale Machine Learning, A two-step iterative algorithm for sparse hyperspectral unmixing via total variation, Poisson noise reduction with non-local PCA, Fast thresholding algorithms with feedbacks for sparse signal recovery, Robust dequantized compressive sensing, A new spectral method for \(l_1\)-regularized minimization, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization, Nesterov's algorithm solving dual formulation for compressed sensing, Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing, The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, Analysis of compressed distributed adaptive filters, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, On sparse beamformer design with reverberation, Modular proximal optimization for multidimensional total-variation regularization, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster, An efficient optimization approach for a cardinality-constrained index tracking problem, A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization, A second-order method for convex₁-regularized optimization with active-set prediction, Projection onto a Polyhedron that Exploits Sparsity, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity, A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression, An adaptive algorithm for TV-based model of three norms \(L_q\) \((q = \frac{1}{2}, 1, 2)\) in image restoration, Accelerated augmented Lagrangian method for total variation minimization, A family of spectral gradient methods for optimization, On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems, Multilevel preconditioning and adaptive sparse solution of inverse problems, A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method, Unnamed Item, Primal–dual first-order methods for a class of cone programming, First- and second-order necessary conditions via exact penalty functions, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, Rank-one and sparse matrix decomposition for dynamic MRI