Linearized alternating directions method for _1-norm inequality constrained _1-norm minimization
From MaRDI portal
Publication:2509909
Recommendations
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Local R-linear convergence of ADMM-based algorithm for _1-norm minimization with linear and box constraints
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
Cites work
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Atomic decomposition by basis pursuit
- Compressed sensing
- Efficient learning of label ranking by soft projections onto polyhedra
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Probing the Pareto frontier for basis pursuit solutions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse Reconstruction by Separable Approximation
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
Cited in
(9)- Simplified reproducing kernel method for impulsive delay differential equations
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- A novel method for nonlinear impulsive differential equations in broken reproducing kernel space
- Numerical method and convergence order for second-order impulsive differential equations
- A proximal Peaceman-Rachford splitting method for compressive sensing
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Local R-linear convergence of ADMM-based algorithm for _1-norm minimization with linear and box constraints
This page was built for publication: Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509909)
