Sparse Reconstruction by Separable Approximation

Cited In (only showing first 100 items - show all)

An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
Globally sparse and locally dense signal recovery for compressed sensing
On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
Inexact successive quadratic approximation for regularized optimization
A residual-based algorithm for solving a class of structured nonsmooth optimization problems
Generalized conjugate gradient methods for \(\ell_1\) regularized convex quadratic programming with finite convergence
Sparse reconstructions of acoustic source for inverse scattering problems in measure space
A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
First- and second-order necessary conditions via exact penalty functions
Optimization methods for large-scale machine learning
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
A truncated Newton algorithm for nonconvex sparse recovery
A nonmonotone alternating updating method for a class of matrix factorization problems
A new spectral method for \(l_1\)-regularized minimization
A global sparse gradient based coupled system for image denoising
Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology
Asynchronous stochastic coordinate descent: parallelism and convergence properties
Penalty methods for a class of non-Lipschitz optimization problems
Iterative methods based on soft thresholding of hierarchical tensors
Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
On globally Q-linear convergence of a splitting method for group Lasso
GPU accelerated greedy algorithms for compressed sensing
Forward-backward quasi-Newton methods for nonsmooth optimization problems
An improved variational model for denoising magnetic resonance images
An efficient optimization approach for a cardinality-constrained index tracking problem
Efficient nonconvex sparse group feature selection via continuous and discrete optimization
On the acceleration of the Barzilai-Borwein method
Sparse representation based Fisher discrimination dictionary learning for image classification
A regularized semi-smooth Newton method with projection steps for composite convex programs
On quasi-Newton forward-backward splitting: proximal calculus and convergence
Poisson noise reduction with non-local PCA
An ADMM algorithm for second-order TV-based MR image reconstruction
Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
Sampling in the analysis transform domain
A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
Primal-dual first-order methods for a class of cone programming
A two-step iterative algorithm for sparse hyperspectral unmixing via total variation
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
Exploring chaotic attractors in nonlinear dynamical system under fractal theory
Fast thresholding algorithms with feedbacks for sparse signal recovery
Combining line search and trust-region methods forℓ1-minimization
An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
Bound alternative direction optimization for image deblurring
Gradient-based method with active set strategy for \(\ell _1\) optimization
Linearized alternating direction method of multipliers for sparse group and fused Lasso models
Robust dequantized compressive sensing
An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
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
\(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
Decomposable norm minimization with proximal-gradient homotopy algorithm
\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction
Title not available (Why is that?)
Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
An iteratively approximated gradient projection algorithm for sparse signal reconstruction
Inexact variable metric stochastic block-coordinate descent for regularized optimization
Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
Accelerating block coordinate descent methods with identification strategies
A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
A performance guarantee for orthogonal matching pursuit using mutual coherence
Title not available (Why is that?)
On the rate of convergence of projected Barzilai-Borwein methods
A proximal difference-of-convex algorithm with extrapolation
On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems
A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
Rank-one and sparse matrix decomposition for dynamic MRI
Rician noise removal via weighted nuclear norm penalization
Reconstruction under outliers for Fourier-sparse functions
Further properties of the forward-backward envelope with applications to difference-of-convex programming
Modular proximal optimization for multidimensional total-variation regularization
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
On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs
Flexible Krylov methods for \(\ell_p\) regularization
Iteratively reweighted \(\ell _1\) algorithms with extrapolation
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
Efficient sparse semismooth Newton methods for the clustered Lasso problem
A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing \(\ell_1\) regularized problem
Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix
Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields
A stochastic semismooth Newton method for nonsmooth nonconvex optimization
Extracting Sparse High-Dimensional Dynamics from Limited Data
Performance comparisons of greedy algorithms in compressed sensing.
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope

This page was built for publication: Sparse Reconstruction by Separable Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569734)