Low Complexity Regularization of Linear Inverse Problems
From MaRDI portal
Publication:2799919
DOI10.1007/978-3-319-19749-4_3zbMath1358.94016arXiv1407.1598OpenAlexW2233806934MaRDI QIDQ2799919
Jalal Fadili, Samuel Vaiter, Gabriel Peyré
Publication date: 14 April 2016
Published in: Sampling Theory, a Renaissance (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1598
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Nonsmoothness in machine learning: specific structure, proximal identification, and applications ⋮ Sensitivity Analysis for Mirror-Stratifiable Convex Functions ⋮ Local linear convergence of a primal-dual algorithm for the augmented convex models ⋮ Continuum Limits of Nonlocal $p$-Laplacian Variational Problems on Graphs ⋮ LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Distributed Learning with Sparse Communications by Identification ⋮ Sharp oracle inequalities for low-complexity priors ⋮ Sampling from non-smooth distributions through Langevin diffusion
Uses Software
Cites Work
- Sparse and Redundant Representations
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Iteratively reweighted least squares minimization for sparse recovery
- Linear Inversion of Band-Limited Reflection Seismograms
- How Biased is the Apparent Error Rate of a Prediction Rule?
- On Measuring and Correcting the Effects of Data Mining and Model Selection
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Signal Recovery and the Large Sieve
- Short term spectral analysis, synthesis, and modification by discrete Fourier transform
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Adaptive Model Selection
- A new approach to variable selection in least squares problems
- Uncertainty principles and ideal atomic decomposition
- Model Consistency of Partly Smooth Regularizers
- A Nonlinear Stein-Based Estimator for Multichannel Image Denoising
- A SURE Approach for Digital Signal/Image Deconvolution Problems
- Generalized SURE for Exponential Families: Applications to Regularization
- Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation?
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Model selection with low complexity priors
- On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Convergence rates of convex variational regularization
- Sparsity and Smoothness Via the Fused Lasso
- The 𝒰-Lagrangian of a convex function
- Active Sets, Nonsmoothness, and Sensitivity
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Inverse problems in spaces of measures
- The degrees of freedom of the Lasso for general design matrix
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Living on the edge: phase transitions in convex programs with random data
- A Probabilistic and RIPless Theory of Compressed Sensing
- Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Uncertainty Principles and Vector Quantization
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Analysis versus synthesis in signal priors
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Nonlocal Means With Dimensionality Reduction and SURE-Based Parameter Selection
- Regularization Parameter Selection for Nonlinear Iterative Image Restoration and MRI Reconstruction Using GCV and SURE-Based Methods
- Alternating Projections on Manifolds
- Towards a Mathematical Theory of Super‐resolution
- Model Selection and Estimation in Regression with Grouped Variables
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
- Some Comments on C P
- Regularization of ill-posed problems in Banach spaces: convergence rates
- Total Generalized Variation
- Convex analysis and monotone operator theory in Hilbert spaces
- Sparse Image and Signal Processing
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Simple bounds for recovering low-complexity models
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Exact reconstruction using Beurling minimal extrapolation
- Degrees of freedom in lasso problems
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- The projected GSURE for automatic parameter tuning in iterative shrinkage methods
- Compressed sensing with coherent and redundant dictionaries
- The solution path of the generalized lasso
- Iterative hard thresholding for compressed sensing
- Linear convergence of iterative soft-thresholding
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact support recovery for sparse spikes deconvolution
- Variational methods in imaging
- A coordinate gradient descent method for nonsmooth separable minimization
- A data-driven block thresholding approach to wavelet estimation
- On the degrees of freedom in shrinkage estimation
- The composite absolute penalties family for grouped and hierarchical variable selection
- From Stein's unbiased risk estimates to the method of generalized cross- validation
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
- Estimation of the mean of a multivariate normal distribution
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Conditional gradient algorithms with open loop step size rules
- A natural identity for exponential families with applications in multiparameter estimation
- Risk bounds for model selection via penalization
- Parallel alternating direction multiplier decomposition of convex programs
- A proximal-based deomposition method for compositions method for convex minimization problems
- Grassmannian frames with applications to coding and communication
- The mathematics of eigenvalue optimization
- Adaptive wavelet estimation: A block thresholding and oracle inequality approach
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- The cosparse analysis model and algorithms
- On the degrees of freedom in shape-restricted regression.
- Asymptotics for Lasso-type estimators.
- Least angle regression. (With discussion)
- Geometric categories and o-minimal structures
- The convex geometry of linear inverse problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Homogeneous penalizers and constraints in convex image restoration
- Local behavior of sparse analysis regularization: applications to risk estimation
- Minimal penalties for Gaussian model selection
- The degrees of freedom of partly smooth regularizers
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- On the ``degrees of freedom of the lasso
- Beyond coherence: Recovering structured time-frequency representations
- Image decomposition into a bounded variation component and an oscillating component
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Exact matrix completion via convex optimization
- Dykstras algorithm with bregman projections: A convergence proof
- An affine scaling methodology for best basis selection
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Necessary conditions for variational regularization schemes
- A Generalized Forward-Backward Splitting
- Proximal Splitting Methods in Signal Processing
- Identifying Active Manifolds in Regularization Problems
- Orthogonal Invariance and Identifiability
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- Certifying the Restricted Isometry Property is Hard
- Robust Sparse Analysis Regularization
- A Bias-Variance Approach for the Nonlocal Means
- Robust principal component analysis?
- Linear convergence rates for Tikhonov regularization with positively homogeneous functionals
- Uncertainty Principles and Signal Recovery
- Learning the Morphological Diversity
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- Identifiable Surfaces in Constrained Optimization
- Generic Optimality Conditions for Semialgebraic Convex Programs
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- An Algorithm for Restricted Least Squares Regression
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- A theory for multiresolution signal decomposition: the wavelet representation
- On sparse reconstruction from Fourier and Gaussian measurements
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Image decomposition via the combination of sparse representations and a variational approach
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- A proximal decomposition method for solving convex variational inverse problems
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
