An iterative reduction FISTA algorithm for large-scale LASSO
From MaRDI portal
(Redirected from Publication:5088796)
Recommendations
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- scientific article; zbMATH DE number 62436
Cites work
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- Adaptive restart for accelerated gradient schemes
- Adaptive restart of the optimized gradient method for convex optimization
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- An inexact successive quadratic approximation method for L-1 regularized optimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Least angle regression. (With discussion)
- Linear convergence of first order methods for non-strongly convex optimization
- Matrix-free interior point method for compressed sensing problems
- Minimization of \(\ell_{1-2}\) for compressed sensing
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- Probing the Pareto frontier for basis pursuit solutions
- Quasi-Newton approach to nonnegative image restorations
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Restoring Images Degraded by Spatially Variant Blur
- Smooth minimization of non-smooth functions
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- The Adaptive Lasso and Its Oracle Properties
- The Split Bregman Method for L1-Regularized Problems
- Two-Metric Projection Methods for Constrained Optimization
Cited in
(6)- An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- A reduced half thresholding algorithm
- An l-BFGS algorithm for solving large-scale \(\ell_1\) problems
This page was built for publication: An iterative reduction FISTA algorithm for large-scale LASSO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088796)
