A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
From MaRDI portal
(Redirected from Publication:150994)
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)- Approximation method for monotone inclusion problems in real Banach spaces with applications
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- A hybrid splitting method for smoothing Tikhonov regularization problem
- Multilevel preconditioning and adaptive sparse solution of inverse problems
- Fast and Exact Leave-One-Out Analysis of Large-Margin Classifiers
- A new computational method for the sparsest solutions to systems of linear equations
- Separating variables to accelerate non-convex regularized optimization
- Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces
- SLOPE-adaptive variable selection via convex optimization
- Inexact accelerated augmented Lagrangian methods
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- An Accelerated Level-Set Method for Inverse Scattering Problems
- Inertial projected gradient method for large-scale topology optimization
- Inertial, corrected, primal-dual proximal splitting
- An Efficient Greedy Search Algorithm for High-Dimensional Linear Discriminant Analysis
- Unifying mirror descent and dual averaging
- An optimal-storage approach to semidefinite programming using approximate complementarity
- A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
- A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems
- l₁-regularization for multi-period portfolio selection
- Sparsity with sign-coherent groups of variables via the cooperative-Lasso
- A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- An inertial extrapolation method for convex simple bilevel optimization
- Nomonotone spectral gradient method for sparse recovery
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
- On the proximal gradient algorithm with alternated inertia
- Compressive Sensing
- On the convergence of a class of inertial dynamical systems with Tikhonov regularization
- Randomized block proximal damped Newton method for composite self-concordant minimization
- Convergence of contrastive divergence algorithm in exponential family
- $\ell _0$ Minimization for wavelet frame based image restoration
- Graph transform learning
- Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Composite convex optimization with global and local inexact oracles
- A cubic spline penalty for sparse approximation under tight frame balanced model
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- A Projected Nesterov–Kaczmarz Approach to Stellar Population-Kinematic Distribution Reconstruction in Extragalactic Archaeology
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- Regularization by architecture: a deep prior approach for inverse problems
- Variational networks: an optimal control approach to early stopping variational methods for image restoration
- An inexact Riemannian proximal gradient method
- LSALSA: accelerated source separation via learned sparse coding
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
- scientific article; zbMATH DE number 7306860 (Why is no real title available?)
- Sparsest piecewise-linear regression of one-dimensional data
- Sparse Bayesian imaging of solar flares
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- A self adaptive inertial subgradient extragradient algorithm for variational inequality and common fixed point of multivalued mappings in Hilbert spaces
- An acceleration of proximal diagonal Newton method
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Radial duality. II: Applications and algorithms
- Bayesian Inference with Projected Densities
- Newton-type methods with the proximal gradient step for sparse estimation
- Huberization image restoration model from incomplete multiplicative noisy data
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm
- Sparse identification of posynomial models
- Multiple change points detection in high-dimensional multivariate regression
- An accelerated method for nonlinear elliptic PDE
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- A robust and efficient variable selection method for linear regression
- Proximal algorithms for multicomponent image recovery problems
- Convergence analysis of modified inertial forward–backward splitting scheme with applications
- Using a library of chemical reactions to fit systems of ordinary differential equations to agent-based models: a machine learning approach
- Inexact Newton-Landweber iteration in Banach spaces with nonsmooth convex penalty terms
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem
- Three novel two-step proximal-like methods for solving equilibrium and fixed point problems in real Hilbert spaces
- Sparse subspace clustering for data with missing entries and high-rank matrix completion
- An off-the-grid approach to multi-compartment magnetic resonance fingerprinting
- A hierarchical variational inequality problem for generalized demimetric mappings with applications
- Fast optimization methods for high-dimensional row-sparse multivariate quantile linear regression
- An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- D4R: doubly robust reduced rank regression in high dimension
- Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application
- A simplified L-curve method as error estimator
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Multikernel regression with sparsity constraint
- Parallel Nesterov domain decomposition method for elliptic partial differential equations
- Enhancement of Compton camera images reconstructed by inversion of a conical Radon transform
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Faster Lagrangian-based methods in convex optimization
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- A new method with regularization for solving split variational inequality problems in real Hilbert spaces
- A regularizing multilevel approach for nonlinear inverse problems
- An inertial proximal-gradient penalization scheme for constrained convex optimization problems
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
- Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics
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)
