Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
From MaRDI portal
Publication:3395007
DOI10.1137/070698920zbMATH Open1180.65076OpenAlexW2009702064MaRDI QIDQ3395007FDOQ3395007
Authors: E. T. Hale, Wotao Yin, Yin Zhang 
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070698920
Recommendations
- Bregman Iterative Algorithms for $\ell_1$-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 \(\ell_1\)-regularized convex functions
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
operator splittingconvergencenumerical resultscompressed sensingcontinuation methodpath-following method\(l_1\) regularizationfix-point algorithmlarge-scale \(l_1\) regularized convex minimization problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Cited In (only showing first 100 items - show all)
- A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
- Sparse identification of posynomial models
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- The modified accelerated Bregman method for regularized basis pursuit problem
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- 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
- A parallel line search subspace correction method for composite convex optimization
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- A linearly convergent algorithm for sparse signal reconstruction
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- Local linear convergence analysis of primal-dual splitting methods
- A new spectral method for \(l_1\)-regularized minimization
- DC programming and DCA: thirty years of developments
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- Low complexity regularization of linear inverse problems
- Activity identification and local linear convergence of forward-backward-type methods
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- Sensitivity analysis for mirror-stratifiable convex functions
- Modified three-term conjugate gradient method and its applications
- 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
- A new algorithm framework for image inpainting in transform domain
- Sparse recovery via differential inclusions
- Robust subspace segmentation via nonconvex low rank representation
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Variable splitting based method for image restoration with impulse plus Gaussian noise
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
- Noisy 1-bit compressive sensing: models and algorithms
- Sampling in the analysis transform domain
- Gene selection and prediction for cancer classification using support vector machines with a reject option
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Regularized sparse representation for image deconvolution
- Primal-dual first-order methods for a class of cone programming
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Accelerated augmented Lagrangian method for total variation minimization
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- Proximal gradient method for huberized support vector machine
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- Forward-backward-based descent methods for composite variational inequalities
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
- Iterative regularization via dual diagonal descent
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
- 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
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- Accelerating near-field 3D imaging approach for joint high-resolution imaging and phase error correction
- Sparse broadband beamformer design via proximal optimization Techniques
- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- On the proximal gradient algorithm with alternated inertia
- Nomonotone spectral gradient method for sparse recovery
- Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- A proximal method for composite minimization
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- A unified primal-dual algorithm framework based on Bregman iteration
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- An alternating direction algorithm for matrix completion with nonnegative factors
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- Accelerated linearized Bregman method
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Proximal splitting methods in signal processing
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Inertial proximal ADMM for linearly constrained separable convex optimization
- On the convergence of an active-set method for \(\ell_1\) minimization
- An alternating direction method for linear-constrained matrix nuclear norm minimization.
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Mixed linear system estimation and identification
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- 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
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- 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
- Augmented \(\ell_1\) and nuclear-norm models with a globally linearly convergent algorithm
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- First-order optimality condition of basis pursuit denoise problem
- The convex geometry of linear inverse problems
- Projected Landweber iteration for matrix completion
- Domain decomposition methods for nonlocal total variation image restoration
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Efficient algorithms for robust and stable principal component pursuit problems
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)
