Fast algorithm for constrained linear inverse problems

MaRDI QIDQ6887361zbMATH OpenFDO

Authors Mohammed Rayyan Sheriff, Floor Fenne Redel, Peyman Mohajerin Esfahani

Publication date 9 December 2025

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/22-1380.html

zbMATH Keywords

image processinglinear inverse problemsmin-max problemssparse coding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites work

• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Blind Compressed Sensing
• Compressed sensing
• Exact matrix completion via convex optimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On generalized Hölder inequality
• On the ergodic convergence rates of a first-order primal-dual algorithm
• The convex geometry of linear inverse problems

This page was built for publication: Fast algorithm for constrained linear inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887361)