Research map / Learning theory and algorithms / Matrix and tensor methods
Novel Min-Max Reformulations of Linear Inverse Problems
Mohammed Rayyan Sheriff, Debasish Chatterjee
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| apply min-max BPDN reformulation to denoise cameraman image | Min-max constrained BPDN · BPDN denoising, cameraman 256x256 | PSNR (dB): 22.0741 -> 26.8119 | Improved |
| apply min-max BPDN reformulation to denoise flower image | Min-max unconstrained BPDN · BPDN denoising, flower image | PSNR (dB): 23.0954 -> 28.5362 | Improved |
| use constrained min-max formulation instead of unconstrained | BPDN saddle-point algorithms · BPDN single patch convergence | iterations to converge | Mixed |
Closest papers by meaning
- Fast Algorithm for Constrained Linear Inverse Problems (JMLR 2025 · similarity 0.92)
- A convex program for bilinear inversion of sparse vectors (NeurIPS 2018 · similarity 0.86)
- Global Optimality for Non-linear Constrained Restoration Problems via Invexity (ICLR 2024 · similarity 0.85)
- Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation (ICML 2024 · similarity 0.85)
- Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees (ICLR 2025 · similarity 0.83)
- NPN: Non-Linear Projections of the Null-Space for Imaging Inverse Problems (NeurIPS 2025 · similarity 0.83)
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.
