12 problems
- 0 votes0 replies0 views
Sparse-coupling instability conjecture for Bregman ADMM
The consensus model assumes a separable objective of the form , with each term depending only on agent 's own variables. In the non-separa…
- 0 votes0 replies1 view
Penalty-parameter updates escape second-order-dominant regions in ADMM
Consider the six semidefinite programs in Group II of Experiment II, namely 1dc1024, G40mb, hand, neosfbr25, r12000, and swissroll, and let denote the ADMM penalty paramet…
- 0 votes0 replies2 views
Cone equality as a necessary condition for local linear convergence of one-step ADMM
Let be the final convergent point of the iterations of one-step ADMM. Let be the cone used in the local second-order analysis, and let…
- 0 votes0 replies1 view
Range inclusion conjecture for the second-order ADMM limit map
Let be a reference point, let denote the cone appearing in the local second-order ADMM analysis, and let…
- 0 votes0 replies1 view
KKT-limit conjecture for TOP-ADMM on the nonconvex P3 problem
Let TOP-ADMM generate sequences for the nonconvex problem , and let a KKT point mean a point satisfying the dual-feasibility and primal-feasibility conditions for the…
- 0 votes0 replies0 views
Asymptotic residual-vanishing conjecture for TOP-ADMM on the nonconvex P3 problem
Let be the paper's nonconvex optimization problem with iteration-dependent convexified PAPR and ACLR constraint sets, and let TOP-ADMM denote the corresponding algori…
- 0 votes0 replies0 views
Linear convergence conjecture for NysADMM with strongly convex loss
NysADMM linear convergence conjecture. A modification of the authors' argument should show that NysADMM converges linearly for any strongly convex loss.
- 0 votes0 replies2 views
The square-root convergence-speedup conjecture for distributed ADMM
Let and denote the asymptotic convergence rates of distributed ADMM and gradient descent, respectively, and let and denote their optimal rat…
- 0 votes0 replies0 views
Convergence-rate conjecture for distributed ADMM lifting
Consider the quadratic objective referred to in the source and an arbitrary graph . Let and be the optimal convergence rates of gradient…
- 0 votes0 replies0 views
Universal speedup conjecture for distributed ADMM lifting
Let a finite Markov chain be lifted to an expanded state space, and let the corresponding distributed over-relaxed ADMM algorithm be viewed as a lifting of gradient descent (GD) fo…
- 0 votes0 replies0 views
Cyclic ADMM has worse complexity than ALM and randomized ADMM
The setting is a class of problems for which cyclic ADMM with at least three blocks is convergent, such as certain strongly convex problems. Here ALM denotes the Augmented Lagrangi…
- 0 votes0 replies0 views
Unimprovability of the online stochastic ADMM convergence bounds
Consider the online setting described above, with convergence bounds of order when , and of order…