Sparse Reconstruction by Separable Approximation

Cited in

(only showing first 100 items - show all)

Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
Inexact successive quadratic approximation for regularized optimization
\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
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 global sparse gradient based coupled system for image denoising
Primal-dual first-order methods for a class of cone programming
An improved variational model for denoising magnetic resonance images
Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology
Combining line search and trust-region methods forℓ1-minimization
A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction
Iterative methods based on soft thresholding of hierarchical tensors
An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
Optimization methods for large-scale machine learning
Exploring chaotic attractors in nonlinear dynamical system under fractal theory
Sampling in the analysis transform domain
An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
On the acceleration of the Barzilai-Borwein method
Poisson noise reduction with non-local PCA
On globally Q-linear convergence of a splitting method for group Lasso
Linearized alternating direction method of multipliers for sparse group and fused Lasso models
Sparse reconstructions of acoustic source for inverse scattering problems in measure space
scientific article; zbMATH DE number 6860781 (Why is no real title available?)
A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
An efficient optimization approach for a cardinality-constrained index tracking problem
GPU accelerated greedy algorithms for compressed sensing
Bound alternative direction optimization for image deblurring
An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
A two-step iterative algorithm for sparse hyperspectral unmixing via total variation
A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
Asynchronous stochastic coordinate descent: parallelism and convergence properties
A truncated Newton algorithm for nonconvex sparse recovery
A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
Sparse representation based Fisher discrimination dictionary learning for image classification
Penalty methods for a class of non-Lipschitz optimization problems
Gradient-based method with active set strategy for \(\ell _1\) optimization
\(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
A residual-based algorithm for solving a class of structured nonsmooth optimization problems
Decomposable norm minimization with proximal-gradient homotopy algorithm
First- and second-order necessary conditions via exact penalty functions
A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
Robust dequantized compressive sensing
Generalized conjugate gradient methods for \(\ell_1\) regularized convex quadratic programming with finite convergence
An iteratively approximated gradient projection algorithm for sparse signal reconstruction
Globally sparse and locally dense signal recovery for compressed sensing
On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
A new spectral method for \(l_1\)-regularized minimization
A nonmonotone alternating updating method for a class of matrix factorization problems
A regularized semi-smooth Newton method with projection steps for composite convex programs
An ADMM algorithm for second-order TV-based MR image reconstruction
Forward-backward quasi-Newton methods for nonsmooth optimization problems
On quasi-Newton forward-backward splitting: proximal calculus and convergence
Efficient nonconvex sparse group feature selection via continuous and discrete optimization
Fast thresholding algorithms with feedbacks for sparse signal recovery
A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
A partial inexact alternating direction method for structured variational inequalities
SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
Computing and analyzing recoverable supports for sparse reconstruction
An MM Algorithm for Split Feasibility Problems
Inexact accelerated augmented Lagrangian methods
Restoration of images based on subspace optimization accelerating augmented Lagrangian approach
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
Approximation accuracy, gradient methods, and error bound for structured convex optimization
A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
Projection algorithms for nonconvex minimization with application to sparse principal component analysis
scientific article; zbMATH DE number 5853153 (Why is no real title available?)
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
Incremental majorization-minimization optimization with application to large-scale machine learning
Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
Ensemble extreme learning machine and sparse representation classification
The convex geometry of linear inverse problems
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
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
Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
A proximal method for composite minimization
Inexact coordinate descent: complexity and preconditioning
An improved fast iterative shrinkage thresholding algorithm for image deblurring
Image deblurring by sparsity constraint on the Fourier coefficients
Sparsity reconstruction in electrical impedance tomography: an experimental evaluation
Sparse representations and approximation theory
An augmented Lagrangian method for optimization problems with structured geometric constraints
A family of second-order methods for convex \(\ell _1\)-regularized optimization
A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
A reconstruction algorithm for electrical impedance tomography based on sparsity regularization
Block coordinate descent algorithms for large-scale sparse multiclass classification
Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
Efficient block-coordinate descent algorithms for the group Lasso
A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
A new analysis on the Barzilai-Borwein gradient method
Incremental projection approach of regularization for inverse problems
Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
Sample size selection in optimization methods for machine learning

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)