Research map / Optimization / Nonconvex and smooth optimization
Non-Ergodic Alternating Proximal Augmented Lagrangian Algorithms with Optimal Rates
Quoc Tran Dinh
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 NEAPAL instead of Tuned-ADMM | NEAPAL · Logo image IBM recovery | time: 12.7 -> 8.5 | Improved |
| use NEAPAL instead of Tuned-ADMM | NEAPAL · Logo image TUM recovery | time: 20.1 -> 7.6 | Improved |
| use NEAPAL instead of ASGARD | NEAPAL · Logo image MIT recovery | relative error: 0.0501 -> 0.0485 | Improved |
| use NEAPAL instead of ASGARD | NEAPAL · Logo image TUM recovery | relative error: 0.0382 -> 0.0390 | Hurt |
| use NEAPAL instead of ASGARD | NEAPAL · Logo images | PSNR | No clear effect |
| use NEAPAL instead of ASGARD | NEAPAL · Logo image IBM recovery | time: 8.0 -> 8.5 | Hurt |
| parallel variant NEAPAL-par vs Algorithm 1 | NEAPAL · square-root LASSO | relative objective residual | No clear effect |
| Algorithm 2 (scvx-NEAPAL) vs Chambolle-Pock | scvx-NEAPAL · square-root LASSO | relative objective residual | Mixed |
| restarting ASGARD without strong convexity | ASGARD-rs · square-root LASSO | relative objective residual | Hurt |
| use averaging sequence of Chambolle-Pock | CP-Avg · square-root LASSO | relative objective residual | Hurt |
Closest papers by meaning
- On a Combination of Alternating Minimization and Nesterov’s Momentum (ICML 2021 · similarity 0.90)
- Faster and Non-ergodic O(1/K) Stochastic Alternating Direction Method of Multipliers (NeurIPS 2017 · similarity 0.89)
- Inexact Augmented Lagrangian Methods for Conic Optimization: Quadratic Growth and Linear Convergence (NeurIPS 2024 · similarity 0.88)
- Barrier Algorithms for Constrained Non-Convex Optimization (ICML 2024 · similarity 0.86)
- Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints (ICML 2025 · similarity 0.86)
- Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion (ICML 2024 · similarity 0.86)
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.
