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
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
An iterative reduction FISTA algorithm for large-scale LASSO
Sparsity constrained estimation in image processing and computer vision
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
Robust data assimilation using $L_1$ and Huber norms
A family of spectral gradient methods for optimization
A hybrid finite-dimensional RHC for stabilization of time-varying parabolic equations
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
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
Truncated $L_1$ regularized linear regression: theory and algorithm
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
A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
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
Randomized block proximal damped Newton method for composite self-concordant minimization
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

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)