Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
From MaRDI portal
(Redirected from Publication:3395007)
Fixed-Point Continuation for $\ell 1$-Minimization: Methodology and Convergence
Fixed-Point Continuation for $\ell 1$-Minimization: Methodology and Convergence
Recommendations
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Two-step version of fixed point continuation method for sparse reconstruction
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A reduced-space algorithm for minimizing _1-regularized convex functions
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
Cited in
(only showing first 100 items - show all)- Mixed linear system estimation and identification
- A linearly convergent algorithm for sparse signal reconstruction
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- Robust subspace segmentation via nonconvex low rank representation
- A unified approach to error bounds for structured convex optimization problems
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Smoothed _1-regularization-based line search for sparse signal recovery
- Iterative regularization via dual diagonal descent
- Accelerating near-field 3D imaging approach for joint high-resolution imaging and phase error correction
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- DC programming and DCA: thirty years of developments
- On the proximal gradient algorithm with alternated inertia
- Templates for convex cone problems with applications to sparse signal recovery
- Variable splitting based method for image restoration with impulse plus Gaussian noise
- The convex geometry of linear inverse problems
- Error forgetting of Bregman iteration
- Accelerated linearized Bregman method
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- New nonsmooth equations-based algorithms for _1-norm minimization and applications
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- Modified algorithms for image inpainting in Fourier transform domain
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- A projection method for convex constrained monotone nonlinear equations with applications
- A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- Low-rank elastic-net regularized multivariate Huber regression model
- An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- A total fractional-order variation model for image super-resolution and its SAV algorithm
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- Matrix completion for matrices with low-rank displacement
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Bregman reweighted alternating minimization and its application to image deblurring
- Convergence of projected Landweber iteration for matrix rank minimization
- A new spectral method for \(l_1\)-regularized minimization
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- Restoration of images corrupted by mixed Gaussian-impulse noise via \(l_{1}-l_{0}\) minimization
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- A penalty decomposition method for rank minimization problem with affine constraints
- Projective robust nonnegative factorization
- Pairwise constraint propagation via low-rank matrix recovery
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Modified three-term conjugate gradient method and its applications
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Mixture augmented Lagrange multiplier method for tensor recovery and its applications
- Accelerated augmented Lagrangian method for total variation minimization
- Proximal gradient method for huberized support vector machine
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Performance of first- and second-order methods for _1-regularized least squares problems
- Local linear convergence of a primal-dual algorithm for the augmented convex models
- The modified accelerated Bregman method for regularized basis pursuit problem
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Convex optimization approach to signals with fast varying instantaneous frequency
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- A simple homotopy proximal mapping algorithm for compressive sensing
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Efficient algorithms for robust and stable principal component pursuit problems
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
- A parallel line search subspace correction method for composite convex optimization
- Nomonotone spectral gradient method for sparse recovery
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Nonlinear regularization techniques for seismic tomography
- A provably convergent scheme for compressive sensing under random generative priors
- An active set Newton-CG method for \(\ell_1\) optimization
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- On FISTA with a relative error rule
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A new algorithm framework for image inpainting in transform domain
- Low complexity regularization of linear inverse problems
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- Forward-backward-based descent methods for composite variational inequalities
- Primal-dual first-order methods for a class of cone programming
- Augmented _1 and nuclear-norm models with a globally linearly convergent algorithm
- Proximal splitting methods in signal processing
- On the convergence of an active-set method for _1 minimization
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Activity identification and local linear convergence of forward-backward-type methods
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A proximal method for composite minimization
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- Compressed sensing by iterative thresholding of geometric wavelets: a comparing study
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
This page was built for publication: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395007)
