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)- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
- Instability, computational efficiency and statistical accuracy
- Nomonotone spectral gradient method for sparse recovery
- On the proximal gradient algorithm with alternated inertia
- Mixture augmented Lagrange multiplier method for tensor recovery and its applications
- Sparse identification of posynomial models
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Precise Stability Phase Transitions for \ell₁ Minimization: A Unified Geometric Framework
- The modified accelerated Bregman method for regularized basis pursuit problem
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- A proximal method for composite minimization
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Modified algorithms for image inpainting in Fourier transform domain
- A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography
- Accelerated matrix completion algorithm using continuation strategy and randomized SVD
- A parallel line search subspace correction method for composite convex optimization
- Fast sparse reconstruction: Greedy inverse scale space flows
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- A unified primal-dual algorithm framework based on Bregman iteration
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- A new generalized shrinkage conjugate gradient method for sparse recovery
- An alternating direction algorithm for matrix completion with nonnegative factors
- Compact dictionary pair learning and refining based on principal components analysis
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- A linearly convergent algorithm for sparse signal reconstruction
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Accelerated linearized Bregman method
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- Rumor transmission in online social networks under Nash equilibrium of a psychological decision game
- A separable surrogate function method for sparse and low-rank matrices decomposition
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- Incremental majorization-minimization optimization with application to large-scale machine learning
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Cardinality minimization, constraints, and regularization: a survey
- On the analysis of semismooth Newton-type methods for composite optimization
- Proximal splitting methods in signal processing
- A new spectral method for \(l_1\)-regularized minimization
- DC programming and DCA: thirty years of developments
- Doubly robust logistic regression for image classification
- Local linear convergence analysis of primal-dual splitting methods
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- Low complexity regularization of linear inverse problems
- Activity identification and local linear convergence of forward-backward-type methods
- Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
- Sensitivity analysis for mirror-stratifiable convex functions
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Implicit regularization with strongly convex bias: Stability and acceleration
- Inertial proximal ADMM for linearly constrained separable convex optimization
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Modified three-term conjugate gradient method and its applications
- On the convergence of an active-set method for _1 minimization
- Mixed linear system estimation and identification
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- An alternating direction method for linear-constrained matrix nuclear norm minimization.
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A projection method for convex constrained monotone nonlinear equations with applications
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Convex optimization approach to signals with fast varying instantaneous frequency
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Convergence of projected Landweber iteration for matrix rank minimization
- Finite convergence of an active signature method to local minima of piecewise linear functions
- A new algorithm framework for image inpainting in transform domain
- Sparse recovery via differential inclusions
- Elastic-net regularization for low-rank matrix recovery
- Matrix completion for matrices with low-rank displacement
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- Robust subspace segmentation via nonconvex low rank representation
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- An iterative algorithm for third-order tensor multi-rank minimization
- Proximal methods for the latent group lasso penalty
- Two-step version of fixed point continuation method for sparse reconstruction
- Another hybrid approach for solving monotone operator equations and application to signal processing
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Nonlinear regularization techniques for seismic tomography
- A provably convergent scheme for compressive sensing under random generative priors
- Augmented _1 and nuclear-norm models with a globally linearly convergent algorithm
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- First-order optimality condition of basis pursuit denoise problem
- Performance of first- and second-order methods for _1-regularized least squares problems
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- The convex geometry of linear inverse problems
- An active set Newton-CG method for \(\ell_1\) optimization
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Logarithmic function minimization to compressed sensing with application to magnetic resonance imaging
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)
