A simple adaptive accelerated optimistic dual averaging method for unconstrained convex optimization in $p$-norm geometry
Efficient preconditioning plays an important role in large-scale first-order optimization. In this paper, we propose an adaptive accelerated optimistic dual averaging ($\text{A}^2$ODA) method for unconstrained convex optimization that adopts low-cost preconditioning based on $p$-norm geometry for $p\in[2,\infty]$. The method is line-search-free and employs a new stepsize selection technique based…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
