Research map / Learning theory and algorithms / Matrix and tensor methods
A New Alternating Direction Method for Linear Programming
Sinong Wang, Ness Shroff
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 LPADMM instead of ALCD | LP solver · bp3 (basis pursuit) | solve time (sec): 12862 -> 217 | Improved |
| use LPADMM instead of ALCD | LP solver · bp1 (basis pursuit) | solve time (sec): 864 -> 22 | Improved |
| use LPADMM instead of ALCD | LP solver · arcene (SICE) | solve time (sec): 1978 -> 801 | Improved |
| use LPADMM instead of ALCD | LP solver · real-sim (SICE) | iterations: 18262 -> 4274 | Improved |
| use LPADMM instead of ALCD | LP solver · sonar (NMF) | solve time (sec): 659 -> 258 | Improved |
| use LPADMM instead of ALCD | LP solver · colon (NMF) | iterations: 1288 -> 216 | Improved |
| use LPADMM instead of ALCD | LP solver · colon (NMF) | solve time (sec): 455 -> 395 | Improved |
| use LPADMM instead of standard ADMM | LP solver · arcene (SICE) | solve time (sec): 21329 -> 801 | Improved |
| use LPADMM instead of standard ADMM | LP solver · sonar (NMF) | iterations: 151972 -> 5446 | Improved |
| use LPADMM instead of standard ADMM | LP solver · bp1-bp3 (basis pursuit) | solve time | Improved |
| use LPADMM vs ALCD overall | LP solver · LP benchmarks (BP, SICE, NMF) | iterations and time: 10% -40% iterations and 10% -85% time | Improved |
| use LPADMM vs ALCD on basis pursuit | LP solver · basis pursuit | speedup: 50x speed up | Improved |
Closest papers by meaning
- Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting (AAAI 2016 · similarity 0.89)
- Convergence of Alternating Gradient Descent for Matrix Factorization (NeurIPS 2023 · similarity 0.88)
- Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation (ICLR 2025 · similarity 0.86)
- ADMM for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.85)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.85)
- Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time (ICLR 2024 · similarity 0.84)
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.
