Research map / Learning theory and algorithms / Matrix and tensor methods
Modular Proximal Optimization for Multidimensional Total-Variation Regularization
Alvaro Barbero, Suvrit Sra
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning to solve TV regularised problems with unrolled algorithms (NeurIPS 2020 · similarity 0.91)
- TV: A Sparse Optimization Method for Impulse Noise Image Restoration (TPAMI 2017 · similarity 0.88)
- An Inexact Projected Regularized Newton Method for Fused Zero-norms Regularization Problems (JMLR 2024 · similarity 0.88)
- An Alternating Proximal Splitting Method with Global Convergence for Nonconvex Structured Sparsity Optimization (AAAI 2016 · similarity 0.87)
- Estimating Sparse Signals With Smooth Support via Convex Programming and Block Sparsity (CVPR 2016 · similarity 0.87)
- Split LBI: An Iterative Regularization Path with Structural Sparsity (NeurIPS 2016 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
