A simple adaptive accelerated optimistic dual averaging method for unconstrained convex optimization in $p$-norm geometry

Paper recorded by Signals 4 on 2026-11-03 in cs.AI. Abstract reproduced from arXiv; link to the original below.

Published 2026-11-03 on arXiv · recorded by Signals 4 on 2026-11-04

Category: cs.AI · 人工智能 · first seen 2026-11-04

Abstract

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

Read on arXiv →