Pages that link to "Item:Q4569734"
From MaRDI portal
The following pages link to Sparse Reconstruction by Separable Approximation (Q4569734):
Displayed 50 items.
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Sparse representation based Fisher discrimination dictionary learning for image classification (Q901802) (← links)
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models (Q1623671) (← links)
- Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology (Q1628244) (← links)
- On globally Q-linear convergence of a splitting method for group Lasso (Q1656198) (← links)
- Landmark recognition with sparse representation classification and extreme learning machine (Q1660684) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Shrinking gradient descent algorithms for total variation regularized image denoising (Q1694398) (← links)
- A modified proximal gradient method for a family of nonsmooth convex optimization problems (Q1697903) (← links)
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- A unified formulation for generalized oilfield development optimization (Q1702333) (← links)
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
- Bound alternative direction optimization for image deblurring (Q1717868) (← links)
- A novel model and ADMM algorithm for MR image reconstruction (Q1721096) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix (Q1792415) (← links)
- Monocular extraction of 2.1D sketch using constrained convex optimization (Q1799939) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems (Q1932970) (← links)
- Error forgetting of Bregman iteration (Q1945369) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Bregman operator splitting with variable stepsize for total variation image reconstruction (Q1946629) (← links)
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (Q1952757) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- A generalized matrix Krylov subspace method for TV regularization (Q1989195) (← links)
- A performance guarantee for orthogonal matching pursuit using mutual coherence (Q2003290) (← links)
- A global sparse gradient based coupled system for image denoising (Q2004434) (← links)
- A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction (Q2019701) (← links)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- An efficient algorithm for joint feature screening in ultrahigh-dimensional Cox's model (Q2032191) (← links)
- Rician noise removal via weighted nuclear norm penalization (Q2036417) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- Manifold reconstruction and denoising from scattered data in high dimension (Q2095140) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- Efficient projection algorithms onto the weighted \(\ell_1\) ball (Q2124458) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere (Q2175023) (← links)
- Optimal nonlinear signal approximations based on piecewise constant functions (Q2192284) (← links)