An Iterative Reduction FISTA Algorithm for Large-Scale LASSO
From MaRDI portal
Publication:5088796
DOI10.1137/20M1374328zbMath1489.90062OpenAlexW4285009961MaRDI QIDQ5088796
No author found.
Publication date: 13 July 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1374328
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inexact successive quadratic approximation method for L-1 regularized optimization
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Matrix-free interior point method for compressed sensing problems
- Introductory lectures on convex optimization. A basic course.
- Quasi-Newton approach to nonnegative image restorations
- Adaptive restart of the optimized gradient method for convex optimization
- Least angle regression. (With discussion)
- Adaptive restart for accelerated gradient schemes
- Linear convergence of first order methods for non-strongly convex optimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- The Split Bregman Method for L1-Regularized Problems
- Two-Metric Projection Methods for Constrained Optimization
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Restoring Images Degraded by Spatially Variant Blur
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- Compressed sensing
