Pages that link to "Item:Q5453521"
From MaRDI portal
The following pages link to Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing (Q5453521):
Displaying 47 items.
- Sparse Bayesian Imaging of Solar Flares (Q5236645) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- Simultaneous Cartoon and Texture Image Restoration with Higher-Order Regularization (Q5250011) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
- Multiscale Segmentation via Bregman Distances and Nonlinear Spectral Analysis (Q5266370) (← links)
- Solving Basis Pursuit (Q5270711) (← links)
- Image restoration: Total variation, wavelet frames, and beyond (Q5326482) (← links)
- A dual split Bregman method for fast $\ell ^1$ minimization (Q5326502) (← links)
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity (Q5348469) (← links)
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing (Q5356981) (← links)
- Stochastic Collocation via<i>l</i><sub>1</sub>-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification (Q5372043) (← links)
- High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso (Q5378315) (← links)
- Analysis of Online Composite Mirror Descent Algorithm (Q5380674) (← links)
- CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY (Q5407274) (← links)
- A time continuation based fast approximate algorithm for compressed sensing related optimization (Q5501146) (← links)
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems (Q5737721) (← links)
- Edge Detection of Piecewise Smooth Functions from UnderSampled Fourier Data Using Variance Signatures (Q5738168) (← links)
- A survey on compressive sensing: classical results and recent advancements (Q5855706) (← links)
- Algorithmic versatility of SPF-regularization methods (Q5856262) (← links)
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis (Q5858996) (← links)
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
- Regularized Kaczmarz Algorithms for Tensor Recovery (Q5860371) (← links)
- An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising (Q5860376) (← links)
- A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization (Q5863521) (← links)
- Implicit regularization with strongly convex bias: Stability and acceleration (Q5873931) (← links)
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
- Sparse broadband beamformer design via proximal optimization Techniques (Q6085622) (← links)
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
- Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing (Q6135569) (← links)
- Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme (Q6143259) (← links)
- A New Operator Splitting Method for the Euler Elastica Model for Image Smoothing (Q6176007) (← links)
- The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis (Q6181369) (← links)
- Mathematical and numerical challenges in diffuse optical tomography inverse problems (Q6491041) (← links)
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty (Q6559997) (← links)
- Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization (Q6574508) (← links)
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion (Q6581202) (← links)
- Fast iterative regularization by reusing data (Q6583087) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices (Q6587659) (← links)
- A new prediction-correction primal-dual hybrid gradient algorithm for solving convex minimization problems with Linear constraints (Q6596049) (← links)
- Equivalent resolvents of Douglas-Rachford splitting and other operator splitting algorithms: a unified degenerate proximal point analysis (Q6606317) (← links)
- Bregman methods for large-scale optimization with applications in imaging (Q6606442) (← links)
- Distributed optimisation approach to least-squares solution of Sylvester equations (Q6609070) (← links)
- ADMM for High-Dimensional Sparse Penalized Quantile Regression (Q6622436) (← links)
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems (Q6645935) (← links)
- Dynamic thresholding algorithm with memory for linear inverse problems (Q6659673) (← links)
- Inertial accelerated augmented Lagrangian algorithms with scaling coefficients to solve exactly and inexactly linearly constrained convex optimization problems (Q6664934) (← links)
