Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
From MaRDI portal
Publication:2361128
DOI10.1007/s11590-015-0983-3zbMath1398.90175arXiv1408.5214OpenAlexW2297938271MaRDI QIDQ2361128
Publication date: 29 June 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5214
Related Items
An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ New analysis of linear convergence of gradient-type methods via unifying error bound conditions
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Strongly convex programming for exact matrix completion and robust principal component analysis
- A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
- Introductory lectures on convex optimization. A basic course.
- A dual algorithm for a class of augmented convex signal recovery models
- Adaptive restart for accelerated gradient schemes
- Atomic Decomposition by Basis Pursuit
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Linearized Bregman iterations for compressed sensing
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
