Randomized block-coordinate optimistic gradient algorithms for root-finding problems

DOI10.1287/MOOR.2024.0414MaRDI QIDQ6841256zbMATH OpenFDO

Authors Quoc Tran-Dinh, Yang Luo

Publication date 20 March 2026

Published in Mathematics of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Nesterov's accelerated methodco-coercive equationfinite-sum inclusionoptimistic gradient methodrandomized block-coordinate algorithmweak Minty solution

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Minimax problems in mathematical programming (90C47) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Randomized block-coordinate optimistic gradient algorithms for root-finding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841256)