A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
From MaRDI portal
Publication:150994
DOI10.1137/080716542zbMATH Open1175.94009OpenAlexW2100556411MaRDI QIDQ150994FDOQ150994
Authors: Amir Beck, Marc Teboulle, Amir Beck, Marc Teboulle 
Publication date: January 2009
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bcf48b5e76c7e22335c6820f0de0abe8c5f708b5
Recommendations
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- An improved fast iterative shrinkage thresholding algorithm for image deblurring
- Linear convergence of iterative soft-thresholding
- Eigenvalue-free iterative shrinkage-thresholding algorithm for solving the linear inverse problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
deconvolutionglobal rate of convergenceimage deblurringiterative shrinkage-thresholding algorithmleast squares and \(l_1\) regularization problemslinear inverse problemoptimal gradient methodtwo-step iterative algorithms
Ill-posedness and regularization problems in numerical linear algebra (65F22) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)
Cited In (only showing first 100 items - show all)
- Inexact accelerated augmented Lagrangian methods
- On the proximal gradient algorithm with alternated inertia
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Sparsity with sign-coherent groups of variables via the cooperative-Lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Total variation on a tree
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- An improved fast iterative shrinkage thresholding algorithm for image deblurring
- Accelerated linearized Bregman method
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- On the representation of functions with Gaussian wave packets
- A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems
- First-order methods for convex optimization
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Robust and sparse regression in generalized linear model by stochastic optimization
- An improved fast iterative shrinkage thresholding algorithm with an error for image deblurring problem
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- An alternating iterative algorithm for image deblurring and denoising problems
- A convergent least-squares regularized blind deconvolution approach
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- A first-order primal-dual algorithm with linesearch
- Independent component analysis based on fast proximal gradient
- Mixed-norm regularization for brain decoding
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Inexact first-order primal-dual algorithms
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Exact worst-case performance of first-order methods for composite convex optimization
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Stochastic primal dual fixed point method for composite optimization
- Sparse approximations with interior point methods
- A projection method for convex constrained monotone nonlinear equations with applications
- Community detection in networks via nonlinear modularity eigenvectors
- Incremental projection approach of regularization for inverse problems
- Inexact proximal Newton methods for self-concordant functions
- Efficient first-order methods for convex minimization: a constructive approach
- Level-set methods for convex optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Restoration of images based on subspace optimization accelerating augmented Lagrangian approach
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- A class of alternating linearization algorithms for nonsmooth convex optimization
- Proximal methods for the latent group lasso penalty
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Optimization methods for synthetic aperture radar imaging
- Where did the tumor start? An inverse solver with sparse localization for tumor growth models
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Photoacoustic imaging for attenuating acoustic media
- Localization of extended current source with finite frequencies
- Proximal distance algorithms: theory and practice
- 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
- An ADMM algorithm for second-order TV-based MR image reconstruction
- A stable method solving the total variation dictionary model with \(L^\infty\) constraints
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- A proximal alternating linearization method for nonconvex optimization problems
- Adaptive algorithms for sparse system identification
- On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
- Implementation of an optimal first-order method for strongly convex total variation regularization
- On accelerating the regularized alternating least-squares algorithm for tensors
- Sparsity-Based MIMO Radars
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- A simple strong convergent method for solving split common fixed point problems
- Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference
- Stable multi-label boosting for image annotation with structural feature selection
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- On the finite termination of the gradient projection method
- Active learning for semi-supervised clustering based on locally linear propagation reconstruction
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- An alternating direction method with increasing penalty for stable principal component pursuit
- A Barzilai-Borwein type method for minimizing composite functions
- Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal
- Dualization of signal recovery problems
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Sparse microwave imaging: principles and applications
- Sparse SAR imaging based on \(L_{1/2}\) regularization
- An inexact proximal generalized alternating direction method of multipliers
- An introduction to continuous optimization for imaging
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
- Robust PCA using nonconvex rank approximation and sparse regularizer
- Learning with infinitely many features
- Fast first-order methods for composite convex optimization with backtracking
- Iterative methods for the elastography inverse problem of locating tumors
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
- A new computational method for the sparsest solutions to systems of linear equations
Uses Software
This page was built for publication: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q150994)
