跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20483 · v1

Parallelizable Interior-Point ADMM for Block-Structured Nonconvex Programs

首次提交 2026-11-16 11:50
版本更新 2026-11-16 11:50
雷达观测 2026-11-17 13:07
arXiv ↗PDF ↗

摘要

Physics simulation is an increasingly important computational primitive for AI, and local--global/ADMM splitting exposes its parallel structure but lacks matching finite-time convergence guarantees. We close this gap with two ADMM variants, Interior-Point ADMM (IP-ADMM), for block-structured nonconvex composite programs with smooth nonlinear inequality and affine constraints. A one-sided finite-activation wall keeps each constraint split state strictly feasible while the original-space infeasibility vanishes, giving closed-form constraint updates, one proximal call per objective block, and one equality-constrained quadratic consensus solve per iteration. \rev{To our knowledge, this makes IP-ADMM the first single-loop method that updates nonconvex inequality constraints locally and in parallel with finite-time convergence guarantees.} Ordinary IP-ADMM attains a CQ-free best-iterate weak-KKT rate of O(K−1/3)O(K^{-1/3}) or a banded Fritz--John rate of O(K−1/4)O(K^{-1/4}), which converts to KKT at O(K−1/4)O(K^{-1/4}) under a uniform constraint qualification; these are nearby-point certificates that reduce to conventional KKT for smooth blocks. A checkpoint variant, IP-ADMM-Ckpt, improves the asymptotic KKT exponent to O(K−1/3)O(K^{-1/3}). We also show how the bounds scale with the objective- and constraint-block counts and the coupling norm.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 11:50 · 最新观测版本

Parallelizable Interior-Point ADMM for Block-Structured Nonconvex Programs

Physics simulation is an increasingly important computational primitive for AI, and local--global/ADMM splitting exposes its parallel structure but lacks matching finite-time convergence guarantees. We close this gap with two ADMM variants, Interior-Point ADMM (IP-ADMM), for block-structured nonconvex composite programs with smooth nonlinear inequality and affine constraints. A one-sided finite-activation wall keeps each constraint split state strictly feasible while the original-space infeasibility vanishes, giving closed-form constraint updates, one proximal call per objective block, and one equality-constrained quadratic consensus solve per iteration. \rev{To our knowledge, this makes IP-ADMM the first single-loop method that updates nonconvex inequality constraints locally and in parallel with finite-time convergence guarantees.} Ordinary IP-ADMM attains a CQ-free best-iterate weak-KKT rate of O(K−1/3)O(K^{-1/3}) or a banded Fritz--John rate of O(K−1/4)O(K^{-1/4}), which converts to KKT at O(K−1/4)O(K^{-1/4}) under a uniform constraint qualification; these are nearby-point certificates that reduce to conventional KKT for smooth blocks. A checkpoint variant, IP-ADMM-Ckpt, improves the asymptotic KKT exponent to O(K−1/3)O(K^{-1/3}). We also show how the bounds scale with the objective- and constraint-block counts and the coupling norm.

查看此版本解读 →查看此版本原文 ↗