Research map / Optimization / Nonconvex and smooth optimization
Discerning the Linear Convergence of ADMM for Structured Convex Optimization through the Lens of Variational Analysis
Xiaoming Yuan, Shangzhi Zeng, Jin Zhang
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
- ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization (NeurIPS 2017 · similarity 0.91)
- A Unified Alternating Direction Method of Multipliers by Majorization Minimization (TPAMI 2017 · similarity 0.90)
- Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation (CVPR 2017 · similarity 0.90)
- ADMM for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.89)
- ADMM for Structured Fractional Minimization (ICLR 2025 · similarity 0.87)
- Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems (AAAI 2024 · 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.
