A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
From MaRDI portal
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
Cited in
(only showing first 100 items - show all)- Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data
- Flexible and Interpretable Models for Survival Data
- Sparse principal component analysis via variable projection
- fasta
- Nonparametric operator-regularized covariance function estimation for functional data
- An inertial Mann algorithm for nonexpansive mappings
- Multi-document summarization via group sparse learning
- A regularizing multilevel approach for nonlinear inverse problems
- Group subset selection for linear regression
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Variable selection in general multinomial logit models
- Estimating large correlation matrices for international migration
- MOEA/D with chain-based random local search for sparse optimization
- Variational methods for normal integration
- A convergent least-squares regularized blind deconvolution approach
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
- Comparison of minimization methods for nonsmooth image segmentation
- Accelerating ^1-^2 deblurring using wavelet expansions of operators
- Variational multiscale nonparametric regression: smooth functions
- A simplified view of first order methods for optimization
- Monotone operator theory in convex optimization
- Homogeneity detection for the high-dimensional generalized linear model
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Sparse estimation of high-dimensional correlation matrices
- Towards enhancing stacked extreme learning machine with sparse autoencoder by correntropy
- Multivariate factorizable expectile regression with application to fMRI data
- Backtracking-based iterative regularization method for image compressive sensing recovery
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- A new fast algorithm for constrained four-directional total variation image denoising problem
- A fast dual proximal gradient algorithm for convex minimization and applications
- A closer look at consistent operator splitting and its extensions for topology optimization
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- \(l_{0}\)-norm based structural sparse least square regression for feature selection
- Tuning of the hyperparameters for \(L2\)-loss SVMs with the RBF kernel by the maximum-margin principle and the jackknife technique
- Adaptive restart of the optimized gradient method for convex optimization
- On the parameter estimation problem of magnetic resonance advection imaging
- A scaled gradient method for digital tomographic image reconstruction
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- Global convergence of proximal iteratively reweighted algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Noise-robust semi-supervised learning via fast sparse coding
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- Orbital minimization method with \(\ell^{1}\) regularization
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Conjugate gradient based acceleration for inverse problems
- Approximate ADMM algorithms derived from Lagrangian splitting
- Simultaneous and semi-alternating projection algorithms for solving split equality problems
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Parseval wavelets on hierarchical graphs
- Inexact proximal stochastic gradient method for convex composite optimization
- Shrinking gradient descent algorithms for total variation regularized image denoising
- Stochastic heavy ball
- Smoothed _1-regularization-based line search for sparse signal recovery
- A unified formulation for generalized oilfield development optimization
- The Shannon total variation
- Acceleration of the PDHGM on partially strongly convex functions
- Accelerated alternating descent methods for Dykstra-like problems
- Hierarchical sparse modeling: a choice of two group Lasso formulations
- Inertial projection and contraction algorithms for variational inequalities
- Extragradient method in optimization: convergence and complexity
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Convergence of damped inertial dynamics governed by regularized maximally monotone operators
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Bound alternative direction optimization for image deblurring
- A generalized robust minimization framework for low-rank matrix recovery
- Mixed higher order variational model for image recovery
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
- Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- A fractal shape optimization problem in branched transport
- Convergence of first-order methods via the convex conjugate
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A duality based approach to the minimizing total variation flow in the space \(H^{-s}\)
- Incorporating structural prior information and sparsity into EIT using parallel level sets
- On variance reduction for stochastic smooth convex optimization with multiplicative noise
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Level-set methods for convex optimization
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Variational perspective on local graph clustering
- Efficient histogram dictionary learning for text/image modeling and classification
- Fast L1-L2 minimization via a proximal operator
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion
- Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases
- On accelerating the regularized alternating least-squares algorithm for tensors
- A proximal difference-of-convex algorithm with extrapolation
- An efficient duality-based approach for PDE-constrained sparse optimization
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- An exp model with spatially adaptive regularization parameters for multiplicative noise removal
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)
