Research map / Optimization / Nonconvex and smooth optimization
Fast Algorithm for Constrained Linear Inverse Problems
Mohammed Rayyan Sheriff, Floor Fenne Redel, Peyman Mohajerin Esfahani
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 |
|---|---|---|---|
| use FLIPS instead of Chambolle-Pock for patch denoising | FLIPS · Lena denoising, sliding 4 x 4 patches | CPU time: 14.54 -> 4.95 | Improved |
| use FLIPS instead of C-SALSA for patch denoising | FLIPS · Lena denoising, sliding 32 x 32 patches | CPU time: 43.2 -> 27.23 | Improved |
| use FLIPS instead of CP for patch denoising iterations | FLIPS · Lena denoising, sliding 32 x 32 patches | iterations: 49 -> 2.6 | Improved |
| use FLIPS instead of CP on full-image denoising | FLIPS · Lena denoising, full 512 x 512 | CPU time: 0.54 -> 0.219 | Improved |
| use FLIPS instead of C-SALSA on full-image denoising | FLIPS · Cameraman denoising, full 128 x 128 | CPU time: 0.026 vs 0.025 | No clear effect |
| use FLIPS instead of FISTA for cumulative iterations | FLIPS · Synthetic LIP, SNR 5dB | cumulative iterations: 731.0 -> 93.0 | Improved |
| use FLIPS instead of FISTA for cumulative iterations | FLIPS · Synthetic LIP, SNR 20dB | cumulative iterations: 3690.0 -> 412.0 | Improved |
| use FLIPS instead of projected accelerated gradient descent | FLIPS · Sub-optimality convergence | sub-optimality | Improved |
Closest papers by meaning
- Novel Min-Max Reformulations of Linear Inverse Problems (JMLR 2022 · similarity 0.92)
- A convex program for bilinear inversion of sparse vectors (NeurIPS 2018 · similarity 0.89)
- Global Optimality for Non-linear Constrained Restoration Problems via Invexity (ICLR 2024 · similarity 0.88)
- FAST‑DIPS: Adjoint‑Free Analytic Steps and Hard‑Constrained Likelihood Correction for Diffusion‑Prior Inverse Problems (ICLR 2026 · similarity 0.87)
- Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation (ICML 2024 · similarity 0.85)
- NPN: Non-Linear Projections of the Null-Space for Imaging Inverse Problems (NeurIPS 2025 · similarity 0.85)
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.
