Research map / Optimization / Nonconvex and smooth optimization
Linearized Alternating Direction Method with Penalization for Nonconvex and Nonsmooth Optimization
Read the paperCheck your idea against 108,967 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 for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.91)
- Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting (AAAI 2016 · similarity 0.89)
- A proximal ADMM for multiblock problems with block anti-upper triangular constraints (ICML 2026 · similarity 0.89)
- ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization (NeurIPS 2017 · similarity 0.88)
- Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation (CVPR 2017 · similarity 0.88)
- Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems (AAAI 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.