Sparse Reconstruction by Separable Approximation

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

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
Flexible Krylov Methods for $\ell_p$ Regularization
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
Accelerating block coordinate descent methods with identification strategies
A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁regularized problem
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?)
Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
Sparsity Constrained Estimation in Image Processing and Computer Vision
A proximal difference-of-convex algorithm with extrapolation
Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems
An Iterative Reduction FISTA Algorithm for Large-Scale LASSO
A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
Iterative reweighted methods for $\ell _1-\ell _p$ minimization
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
A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations
Robust Data Assimilation Using $L_1$ and Huber Norms
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
Truncated $L^1$ Regularized Linear Regression: Theory and Algorithm
On the rate of convergence of projected Barzilai–Borwein methods
A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
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
The stochastic properties of $\ell^1$-regularized spherical Gaussian fields
Extracting Sparse High-Dimensional Dynamics from Limited Data
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization
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 successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
A generalized matrix Krylov subspace method for TV regularization
A family of spectral gradient methods for optimization
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
New nonsmooth equations-based algorithms for $\ell_1$-norm minimization and applications
A relaxed-PPA contraction method for sparse signal recovery
A preconditioned conjugate gradient method with active set strategy for $\ell_1$-regularized least squares
PRP-like algorithm for monotone operator equations
Shrinking gradient descent algorithms for total variation regularized image denoising
A modified proximal gradient method for a family of nonsmooth convex optimization problems
A unified formulation for generalized oilfield development optimization
Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
Smoothed $\ell_1$-regularization-based line search for sparse signal recovery
Performance comparisons of greedy algorithms in compressed sensing
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
Convergence properties of monotone and nonmonotone proximal gradient methods revisited
Manifold reconstruction and denoising from scattered data in high dimension
Multilevel preconditioning and adaptive sparse solution of inverse problems
An attention algorithm for solving large scale structured $l_0$-norm penalty estimation problems
Penalty Methods for a Class of Non-Lipschitz Optimization Problems
Globally sparse and locally dense signal recovery for compressed sensing
Inexact successive quadratic approximation for regularized optimization
A residual-based algorithm for solving a class of structured nonsmooth optimization problems
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
On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
A Regularized Newton Method for ${\boldsymbol{\ell}}_{q}$ -Norm Composite Optimization Problems
A truncated Newton algorithm for nonconvex sparse recovery
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
Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
Iterative methods based on soft thresholding of hierarchical tensors
Gradient-based method with active set strategy for $\ell _1$ optimization
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
Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
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
Poisson noise reduction with non-local PCA
$ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames
Primal–dual first-order methods for a class of cone programming
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

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)