Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
From MaRDI portal
Publication:3071331
DOI10.4208/jcm.2009.10-m1007zbMath1224.65153OpenAlexW2015292809MaRDI QIDQ3071331
Wotao Yin, E. T. Hale, Yin Zhang
Publication date: 5 February 2011
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fdc269172b780b83c1f42b0fd3a7da64de116b05
signal recoverynumerical experimentscompressed sensingfixed-point algorithm\(\ell_1\) regularization
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Multiresolution Parameter Choice Method for Total Variation Regularized Tomography, A hybrid quasi-Newton method with application in sparse recovery, Sparse microwave imaging: principles and applications, Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization, Hybrid method for equilibrium problems and fixed point problems of finite families of nonexpansive semigroups, Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces, Golden Ratio Primal-Dual Algorithm with Linesearch, Inexact accelerated augmented Lagrangian methods, Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization, An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions, A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions, Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces, Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, A new generalized shrinkage conjugate gradient method for sparse recovery, A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations, A Barzilai-Borwein type method for minimizing composite functions, An exp model with spatially adaptive regularization parameters for multiplicative noise removal, Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces, A box constrained gradient projection algorithm for compressed sensing, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs, Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence, Unnamed Item, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, Combining line search and trust-region methods forℓ1-minimization
Uses Software
