Pages that link to "Item:Q3071331"

The following pages link to Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments (Q3071331):

Displaying 30 items.

• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Sparse microwave imaging: principles and applications (Q362310) (← links)
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
• Hybrid method for equilibrium problems and fixed point problems of finite families of nonexpansive semigroups (Q380420) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
• An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
• A box constrained gradient projection algorithm for compressed sensing (Q553750) (← links)
• Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces (Q608390) (← links)
• Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces (Q638126) (← links)
• A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
• Inexact accelerated augmented Lagrangian methods (Q887168) (← links)
• An exp model with spatially adaptive regularization parameters for multiplicative noise removal (Q1747638) (← links)
• Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces (Q1760576) (← links)
• A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm (Q2279178) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data (Q2440136) (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
• Multiresolution Parameter Choice Method for Total Variation Regularized Tomography (Q3188212) (← links)
• Combining line search and trust-region methods for<b>ℓ1</b>-minimization (Q5028615) (← links)
• Golden Ratio Primal-Dual Algorithm with Linesearch (Q5093645) (← links)
• (Q5123967) (← links)
• A mixed <i>ℓ</i>₁ regularization approach for sparse simultaneous approximation of parameterized PDEs (Q5216108) (← links)
• Generalized Conjugate Gradient Methods for <i>ℓ</i>₁ Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions (Q6184788) (← links)