Introduction

DOI10.1007/978-3-319-61609-4_1zbMath1443.94028OpenAlexW4235006971MaRDI QIDQ4556975

Vishal Monga

Publication date: 28 November 2018

Published in: Handbook of Convex Optimization Methods in Imaging Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-61609-4_1

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• A new polynomial-time algorithm for linear programming
• Structured Sparse Priors for Image Classification
• Successive QCQP Refinement for MIMO Radar Waveform Design Under Practical Constraints
• Interior Methods for Nonlinear Optimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Iterative Weighted Maximum Likelihood Denoising With Probabilistic Patch-Based Weights
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Introduction