Sparse Reconstruction by Separable Approximation

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

Inexact accelerated augmented Lagrangian methods
Title not available (Why is that?)
Nomonotone spectral gradient method for sparse recovery
Spatio-temporal random fields: compressible representation and distributed estimation
3D reconstruction for partial data electrical impedance tomography using a sparsity prior
Monocular extraction of 2.1D sketch using constrained convex optimization
A proximal method for composite minimization
Inexact coordinate descent: complexity and preconditioning
A family of second-order methods for convex \(\ell _1\)-regularized optimization
SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Sparse representations and approximation theory
Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
A new generalized shrinkage conjugate gradient method for sparse recovery
Computing and analyzing recoverable supports for sparse reconstruction
An improved fast iterative shrinkage thresholding algorithm for image deblurring
A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
An active set algorithm for nonlinear optimization with polyhedral constraints
A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
Incremental majorization-minimization optimization with application to large-scale machine learning
Projection onto a polyhedron that exploits sparsity
Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
A first-order primal-dual algorithm with linesearch
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 Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
A new analysis on the Barzilai-Borwein gradient method
A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
Sparse solutions of a class of constrained optimization problems
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
Incremental projection approach of regularization for inverse problems
A box constrained gradient projection algorithm for compressed sensing
Level-set methods for convex optimization
Practical inexact proximal quasi-Newton method with global complexity analysis
Restoration of images based on subspace optimization accelerating augmented Lagrangian approach
An augmented Lagrangian method for optimization problems with structured geometric constraints
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
An infeasible-point subgradient method using adaptive approximate projections
A partial inexact alternating direction method for structured variational inequalities
An augmented Lagrangian method for non-Lipschitz nonconvex programming
Sparse reconstruction with multiple Walsh matrices
Learning circulant sensing kernels
Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
The convex geometry of linear inverse problems
Sparsity reconstruction in electrical impedance tomography: an experimental evaluation
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Block coordinate descent algorithms for large-scale sparse multiclass classification
Fused multiple graphical lasso
A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
Ensemble extreme learning machine and sparse representation classification
A reconstruction algorithm for electrical impedance tomography based on sparsity regularization
Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
Projection algorithms for nonconvex minimization with application to sparse principal component analysis
Regularisation, optimisation, subregularity
An algorithm for quadratic \(\ell_1\)-regularized optimization with a flexible active-set strategy
Bregman operator splitting with variable stepsize for total variation image reconstruction
Error forgetting of Bregman iteration
Efficient block-coordinate descent algorithms for the group Lasso
An optimal subgradient algorithm for large-scale bound-constrained convex optimization
Structured sparsity through convex optimization
A novel model and ADMM algorithm for MR image reconstruction
Analysis of compressed distributed adaptive filters
An augmented Lagrangian approach for sparse principal component analysis
Templates for convex cone problems with applications to sparse signal recovery
Minimization of \(\ell_{1-2}\) for compressed sensing
An MM Algorithm for Split Feasibility Problems
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
Sample size selection in optimization methods for machine learning
Landmark recognition with sparse representation classification and extreme learning machine
IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
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

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)