Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
From MaRDI portal
Recommendations
- Matrix-free interior point method for compressed sensing problems
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- A numerical exploration of compressed sampling recovery
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Two-step version of fixed point continuation method for sparse reconstruction
- Nonlinear approximation and compressed sensing
- A compressed sensing approach for partial differential equations with random input data
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
Cited in
(37)- An exp model with spatially adaptive regularization parameters for multiplicative noise removal
- Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces
- A hybrid quasi-Newton method with application in sparse recovery
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Multiresolution parameter choice method for total variation regularized tomography
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- 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
- A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A Barzilai-Borwein type method for minimizing composite functions
- Combining line search and trust-region methods forℓ1-minimization
- Golden ratio primal-dual algorithm with linesearch
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- 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
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Randomized block proximal damped Newton method for composite self-concordant minimization
- A box constrained gradient projection algorithm for compressed sensing
- Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces
- 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
- A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
- 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
- Semi-monotone Goldstein line search strategy with application in sparse recovery
- Diagonally scaled memoryless symmetric rank-one methods with application to compressed sensing
- Matrix-free interior point method for compressed sensing problems
- Inexact accelerated augmented Lagrangian methods
This page was built for publication: Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071331)
