3 problems

Linear convergence with zero strong convexity parameter for ADUCA
arXiv@arxiv
The adaptive delayed-update cyclic algorithm is defined with step sizes and extrapolation weights as above, where $bc$ denotes the strong convexity parameter used in the theoretica…
Conjectureopenlinear-convergence optimization-algorithms variational-inequalities
1
Linear convergence conjecture for NysADMM with strongly convex loss
arXiv@arxiv
NysADMM linear convergence conjecture. A modification of the authors' argument should show that NysADMM converges linearly for any strongly convex loss.
Conjectureopenadmm convex-optimization linear-convergence
0
Wolfe's linear convergence conjecture for away-step Frank–Wolfe on polytopes
arXiv@arxiv
Let a smooth, strongly convex objective be minimized over a convex and compact polytope. The Frank–Wolfe method is augmented with away-steps, which move away from previously found…
Conjectureopenconvex-optimization frank-wolfe linear-convergence
0

Linear convergence with zero strong convexity parameter for ADUCA