Sparse Reconstruction by Separable Approximation

DOI10.1109/TSP.2009.2016892zbMath1391.94442WikidataQ60962400 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)

Mathematics Subject Classification ID

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

Related Items

An MM Algorithm for Split Feasibility Problems, Nomonotone spectral gradient method for sparse recovery, 3D reconstruction for partial data electrical impedance tomography using a sparsity prior, A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, Image deblurring by sparsity constraint on the Fourier coefficients, 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, 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, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Block coordinate descent algorithms for large-scale sparse multiclass classification, Spatio-temporal random fields: compressible representation and distributed estimation, SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels, 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, An infeasible-point subgradient method using adaptive approximate projections, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, 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, 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, Decomposable norm minimization with proximal-gradient homotopy algorithm, Incremental projection approach of regularization for inverse problems, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, A box constrained gradient projection algorithm for compressed sensing, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Restoration of images based on subspace optimization accelerating augmented Lagrangian approach, 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, A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems, An augmented Lagrangian approach for sparse principal component analysis, Sample size selection in optimization methods for machine learning, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, GPU accelerated greedy algorithms for compressed sensing, Exploring chaotic attractors in nonlinear dynamical system under fractal theory, Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules, Inexact accelerated augmented Lagrangian methods, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Sampling in the analysis transform domain, Sparse representation based Fisher discrimination dictionary learning for image classification, Linearized alternating direction method of multipliers for sparse group and fused Lasso models, Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology, On globally Q-linear convergence of a splitting method for group Lasso, Landmark recognition with sparse representation classification and extreme learning machine, A regularized semi-smooth Newton method with projection steps for composite convex programs, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, Shrinking gradient descent algorithms for total variation regularized image denoising, A modified proximal gradient method for a family of nonsmooth convex optimization problems, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, A unified formulation for generalized oilfield development optimization, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, Bound alternative direction optimization for image deblurring, A novel model and ADMM algorithm for MR image reconstruction, Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing, 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, A proximal difference-of-convex algorithm with extrapolation, Iterative reweighted methods for \(\ell _1-\ell _p\) minimization, Templates for convex cone problems with applications to sparse signal recovery, A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix, Monocular extraction of 2.1D sketch using constrained convex optimization, The convex geometry of linear inverse problems, An inexact alternating directions algorithm for constrained total variation regularized compressive sensing 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, New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications, Inexact variable metric stochastic block-coordinate descent for regularized optimization, A generalized matrix Krylov subspace method for TV regularization, A performance guarantee for orthogonal matching pursuit using mutual coherence, A global sparse gradient based coupled system for image denoising, A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction, 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, Rician noise removal via weighted nuclear norm penalization, Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere, Optimal nonlinear signal approximations based on piecewise constant functions, Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction, An improved variational model for denoising magnetic resonance images, 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, 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, Unnamed Item, Sparsity Constrained Estimation in Image Processing and Computer Vision, Extracting Sparse High-Dimensional Dynamics from Limited Data, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, 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, Shearlet-based regularized reconstruction in region-of-interest computed tomography, FaRSA for ℓ₁-regularized convex optimization: local convergence and numerical experience, Optimization Methods for Large-Scale Machine Learning, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Modular proximal optimization for multidimensional total-variation regularization, Unnamed Item, On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems, Hybrid Projection Methods with Recycling for Inverse Problems, 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, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems, Sparse and switching infinite horizon optimal controls with mixed-norm penalizations, A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**, A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints, 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, 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, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, Analysis of compressed distributed adaptive filters, On sparse beamformer design with reverberation, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, 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, 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, A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method, 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, 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, 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, Efficient block-coordinate descent algorithms for the group Lasso, 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, 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, A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares, 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, A relaxed-PPA contraction method for sparse signal recovery, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, 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, Linear reconstruction measure steered nearest neighbor classification framework, An active set Newton-CG method for \(\ell_1\) optimization, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, 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 Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression, Primal–dual first-order methods for a class of cone 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, Adaptive control and signal processing literature survey (No. 14), Performance comparisons of greedy algorithms in compressed sensing, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D, Multilevel preconditioning and adaptive sparse solution of inverse problems, Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions, An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, An Introduction to Compressed Sensing, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, 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, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso, A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations, Flexible Krylov Methods for $\ell_p$ Regularization, Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, Minimization of $\ell_{1-2}$ for Compressed Sensing, Fused Multiple Graphical Lasso, Robust Data Assimilation Using $L_1$ and Huber Norms, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization, $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames, A partial inexact alternating direction method for structured variational inequalities, Sparse 3D reconstructions in electrical impedance tomography using real data, 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, Regularisation, optimisation, subregularity