Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization

MaRDI QIDQ7195080arXivFDO

Authors Yuri Nesterov

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Minimax problems in mathematical programming (90C47)

arXiv classification

math.OC

This page was built for publication: Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization

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